Pagini recente » Cod sursa (job #2764928) | Cod sursa (job #1553073) | Cod sursa (job #1316433) | Cod sursa (job #285263) | Cod sursa (job #1515974)
#include <iostream>
#include <fstream>
using namespace std;
int n,test,v[100001];
int test1(int x){
int st=1,dr=n,p=-1,m;
while(st<=dr){
m=(st+dr)/2;
if(v[m]==x){
p=m;
st=m+1;
}
else if(x<v[m])dr=m-1;
else st=m+1;
}
return p;
}
int test2(int x){
int st=1,dr=n,p=0,m;
while(st<=dr){
m=(st+dr)/2;
if(x<v[m])dr=m-1;
else{
p=m;
st=m+1;
}
}
return p;
}
int test3(int x){
int st=1,dr=n,p=-1,m;
while(st<=dr){
m=(st+dr)/2;
if(x<=v[m]){
dr=m-1;
p=m;
}
else st=m+1;
}
return p;
}
int main(){
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int x,y;
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
fin>>test;
for(int i=1;i<=test;i++){
fin>>x>>y;
if(x==0)fout<<test1(y)<<"\n";
if(x==1)fout<<test2(y)<<"\n";
if(x==2)fout<<test3(y)<<"\n";
}
fin.close();
fout.close();
return 0;
}