Pagini recente » Cod sursa (job #2217694) | Cod sursa (job #2541966) | Cod sursa (job #2161021) | Cod sursa (job #2954205) | Cod sursa (job #539850)
Cod sursa(job #539850)
#include<fstream.h>
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,a[100],m,b[100][2];
void cit()
{
int i;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];//citim vectorul
fin>>m;
for(i=1;i<=m;i++)
fin>>b[i][1]>>b[i][2];
}
void binar()
{
int h,g,k,j;
int i,l;
/* if(n%2==0)
l=n/2;
else
l=n/2;
*/
/* for(i=1;i<=m;i++)
if(b[i][2]>a[n/2])
{
g=n/2;
h=n;
}
else
if(b[i][2]<=a[n/2])
{
g=1;
h=n/2;
}
*/
// if(g==1)
for(i=1;i<=m;i++)
{
k=-1;
if(b[i][1]==0)
{
for(j=1;j<=n;j++)
if(b[i][2]==a[j])
k=j;
}
if(b[i][1]==1)
{
for(j=1;j<=n;j++)
if(b[i][2]>=a[j])
k=j;
}
if(b[i][1]==2)
{
for(j=n;j>=1;j--)
if(b[i][2]<=a[j])
k=j;
}
fout<<k<<'\n';
}
/* else
if(g!=1)
for(i=h;i>=g;i--)
{
k=-1;
if(b[i][1]==0)
{
for(j=1;j<=n;j++)
if(b[i][2]==a[j])
k=j;
}
if(b[i][1]==1)
{
for(j=1;j<=n;j++)
if(b[i][2]>=a[j])
k=j;
}
if(b[i][1]==2)
{
for(j=n;j>=1;j--)
if(b[i][2]<=a[j])
k=j;
}
fout<<k<<'\n';
}*/
}
int main()
{
cit();
binar();
return 0;
}