Pagini recente » Cod sursa (job #2924810) | Cod sursa (job #699696) | Cod sursa (job #2653282) | Cod sursa (job #2347305) | Cod sursa (job #1798670)
#include <stdio.h>
#include <stdlib.h>
long long int v[100000],n;
inline long long int f1(long long int x,long long int pas){
long long int r=0;
while(pas>0)
{
if(r+pas<n && v[r+pas]<=x)
r+=pas;
pas/=2;
}
if(v[r]<x)
return -1;
return r+1;
}
inline long long int f2(long long int x,long long int pas){
long long int r=0;
while(pas>0)
{
if(r+pas<n && v[r+pas]<=x)
r+=pas;
pas/=2;
}
return r+1;
}
inline long long int f3(long long int x,long long int pas){
long long int r=0;
while(pas>0)
{
if(r+pas<n && v[r+pas]<x)
r+=pas;
pas/=2;
}
return r+2;
}
long long int main()
{
long long int i,k,c,x,r,p;
FILE*fi,*fo;
fi=fopen("cautbin.in","r");
fo=fopen("cautbin.out","w");
fscanf(fi,"%lld",&n);
for(i=0;i<n;i++)
{
fscanf(fi,"%lld",&v[i]);
}
fscanf(fi,"%lld",&k);
p=1<<17;
for(i=0;i<k;i++)
{
fscanf(fi,"%lld%lld",&c,&x);
if(c==0)
r=f1(x,p);
else if(c==1) r=f2(x,p);
else r=f3(x,p);
fprintf(fo,"%lld\n",r);
}
fclose(fi);
fclose(fo);
return 0;
}