Pagini recente » Cod sursa (job #1944400) | Cod sursa (job #3251316) | Borderou de evaluare (job #2830525) | Cod sursa (job #2755430) | Cod sursa (job #561022)
Cod sursa(job #561022)
#include<stdio.h>
int val,tip,m,n,i,x,v[100001];
int caut0(int x)
{
int i,pas=1<<16;
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 caut1(int x)
{
int i,pas=1<<16;
for(i=0;pas!=0;pas/=2)
if(i+pas<=n&&v[i+pas]<=x)
i+=pas;
return i;
}
int caut2(int x)
{
int i,pas=1<<16;
for(i=0;pas!=0;pas/=2)
if(i+pas<=n&&v[i+pas]<x)
i+=pas;
return i+1;
}
int main()
{
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);
while(m--)
{
scanf("%d%d",&tip,&val);
if(tip==0)
printf("%d\n",caut0(val));
if(tip==1)
printf("%d\n",caut1(val));
if(tip==2)
printf("%d\n",caut2(val));
}
return 0;
}