Pagini recente » Cod sursa (job #401253) | Cod sursa (job #32318) | Cod sursa (job #320759) | Cod sursa (job #400558) | Cod sursa (job #218018)
Cod sursa(job #218018)
#include<stdio.h>
FILE *f=fopen("cautbin.in","r"),
*g=fopen("cautbin.out","w");
long long i,j,m,n,a[100001],x,k;
int bs(long long val)
{ int i, step;
for (step = 1; step<=n; step <<= 1);
for (i = 0; step; step >>= 1)
if (i+step<=n && a[i + step] <= val)
i += step;
return i;
}
int main()
{ fscanf(f,"%lld",&n);
for(i=1;i<=n;++i) fscanf(f,"%lld",&a[i]);
fscanf(f,"%lld",&m);
for(i=1;i<=m;++i)
{ fscanf(f,"%lld %lld",&j,&x);
k=bs(x);
if(j==0) {
if(a[k]==x) fprintf(g,"%lld\n",k);
else fprintf(g,"-1\n");
}
else if(j==1){
fprintf(g,"%lld\n",k);
}
else { while(a[k]<x) ++k;
if(a[k-1]>=x) --k;
fprintf(g,"%lld\n",k);
}
}
fclose(f);
fclose(g);
return 0;
}