Pagini recente » Cod sursa (job #623150) | Cod sursa (job #460377) | Cod sursa (job #322122) | Cod sursa (job #623151) | Cod sursa (job #3262099)
#include <fstream>
using namespace std;
ifstream cin("cautbin.in");
ofstream cout("cautbin.out");
int v[10005];
int cautarebinaradr(int n,int x){
int mij;
int st=1,dr=n;
while(st<dr){
mij=(st+dr)/2;
if(x>=v[mij+1]){
st=mij+1;
}
else{
dr=mij;
}
}
return dr;
}
int cautarebinarast (int n,int y){
int mij;
int st=1,dr=n;
while(st<dr){
mij=(st+dr)/2;
if(y<=v[mij]){
dr=mij;
}
else{
st=mij+1;
}
}
return st;
}
int main()
{
int n,x;
cin>>n;
for(int i=1;i<=n;++i){
cin>>v[i];
}
int m,type,q;
cin>>m;
for(int i=1;i<=m;++i){
cin>>type>>q;
if(type==0){
if(v[cautarebinaradr(n,q)]==q){
cout<<cautarebinaradr(n,q)<<'\n';
}
else {
cout<<"-1"<<'\n';
}
}
if(type==1){
cout<<cautarebinaradr(n,q)<<'\n';
}
if(type==2){
cout<<cautarebinarast(n,q)<<'\n';
}
}
}