Pagini recente » Cod sursa (job #2763931) | Cod sursa (job #292335) | Cod sursa (job #2661657) | Cod sursa (job #21721) | Cod sursa (job #457265)
Cod sursa(job #457265)
#include<stdio.h>
int v[100001],n;
int cautbin0(int x)
{
int pas=1<<16,i;
for (i=0;pas!=0;pas/=2)
if (i+pas <=n && v[i+pas]<=x)
i+=pas;
if(v[i]!=x)
return -1;
return i;
}
int cautbin1(int x)
{
int pas=1<<16,i;
for (i=0;pas!=0;pas/=2)
if (i+pas <=n && v[i+pas]<=x)
i+=pas;
return i;
}
int cautbin2(int x)
{
int pas=1<<16,i;
for (i=0;pas!=0;pas/=2)
if (i+pas <=n && v[i+pas]<x)
i+=pas;
return i+1;
}
int main()
{
int m,i,q,x;
freopen("cautbin.in","r",stdin);
freopen("cautbin.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&v[i]);
scanf("%d",&m);
for(i=1;i<=m;i++)
{
scanf("%d",&q);
scanf("%d",&x);
if(q==0)
printf("%d\n",cautbin0(x));
if(q==1)
printf("%d\n",cautbin1(x));
if(q==2)
printf("%d\n",cautbin2(x));
}
return 0;
}