Pagini recente » Cod sursa (job #3154845) | Cod sursa (job #2192854) | Cod sursa (job #203078) | Cod sursa (job #883244) | Cod sursa (job #402218)
Cod sursa(job #402218)
#include<stdio.h>
int n,m,pas,k,l,a[100000];
int caut1(int x)
{
int i;
pas=1<<16;
for(i=0;pas;pas>>=1)
{
if(i+pas<=n && a[i+pas]<=x)
i+=pas;
}
if(a[i]==x)
return i;
return -1;
}
int caut2(int x)
{
int i;
i=1;pas=1<<16;
for(i=0;pas;pas>>=1)
{
if(i+pas<=n && a[i+pas]<=x)
i+=pas;
}
return i;
}
int caut3(int x)
{
int i;
i=1;pas=1<<16;
for(i=0;pas;pas>>=1)
{
if(i+pas<=n && a[i+pas]<x)
i+=pas;
}
return 1+i;
}
int main()
{
int i,j;
freopen("cautbin.in","r",stdin);
freopen("cautbin.out","w",stdout);
scanf("%ld",&n);
for(i=1;i<=n;i++)
scanf("%ld",&a[i]);
scanf("%ld",&m);
for(i=1;i<=m;i++)
{
scanf("%ld%ld",&k,&l);
if(k==0)
printf("%ld\n",caut1(l));
if(k==1)
printf("%ld\n",caut2(l));
if(k==2)
printf("%ld\n",caut3(l));
}
return 0;
}