Pagini recente » Cod sursa (job #1662508) | Cod sursa (job #1305622) | Cod sursa (job #2918332) | Cod sursa (job #2918362) | Cod sursa (job #398799)
Cod sursa(job #398799)
#include<stdio.h>
int n,x[100000];
int caut0(int a)
{
int i,pas=1<<16;
for(i=0;pas;pas>>=1)
if(i+pas<=n && x[i+pas]<=a) i+=pas;
if(x[i]==a) return i;
return -1;
}
int caut1(int a)
{
int i,pas=1<<16;
for(i=0;pas;pas>>=1)
if(i+pas<=n &&x[i+pas]<=a) i+=pas;
return i;
}
int caut2(int a)
{
int i,pas=1<<16;
for(i=0;pas;pas>>=1)
if(i+pas<=n && x[i+pas]<a) i+=pas;
return i+1;
}
int main()
{
int i,m,k,c;
freopen("cautbin.in","r",stdin);
freopen("cautbin.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d ",&x[i]);
scanf("%d",&m);
for(i=1;i<=m;i++)
{
scanf("%d%d",&k,&c);
if(k==0) printf("%d\n",caut0(c));
if(k==1) printf("%d\n",caut1(c));
if(k==2) printf("%d\n",caut2(c));
}
return 0;
}