Pagini recente » Borderou de evaluare (job #338871) | Cod sursa (job #799902)
Cod sursa(job #799902)
#include<stdio.h>
int n, v[100001];
int caut0(int x){
int i=0,pas;
pas=1<<16;
while(pas!=0)
{
if(i+pas<=n && v[i+pas]<=x)
i += pas;
pas /= 2;
}
if(v[i] != x) return -1;
return i;
}
int caut1(int x){
int i=0,pas;
pas=1<<16;
while(pas!=0)
{
if(i+pas<=n && v[i+pas]<=x)
i += pas;
pas /= 2;
}
return i;
}
int caut2(int x){
int i=0,pas;
pas=1<<16;
while(pas!=0)
{
if(i+pas<=n && v[i+pas]<x)
i += pas;
pas /= 2;
}
return i+1;
}
int main(){
freopen("cautbin.in","r",stdin);
freopen("cautbin.out","w",stdout);
int i,m,x,tip;
scanf("%d",&n);
for(i=1 ; i<=n ; i++)
scanf("%d",&v[i]);
scanf("%d",&m);
for(i=1;i<=m;i++)
{
scanf("%d%d",&tip,&x);
if(tip == 0)
printf("%d\n",caut0(x));
if(tip == 1)
printf("%d\n",caut1(x));
if(tip==2)
printf("%d\n",caut2(x));
}
return 0;
}