Pagini recente » Cod sursa (job #1299010) | Cod sursa (job #291920) | Cod sursa (job #2318146) | Cod sursa (job #2177717) | Cod sursa (job #1106830)
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,m,i,st,dr,mid,q,v[100002],x;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
f>>m;
for(i=1;i<=m;i++){
f>>q>>x;
if(q==0){
st=1;dr=m;
while(st<=dr){
mid=(st+dr)/2;
if(x<v[mid])
dr=mid-1;
else
st=mid+1
}
if(v[dr]!=x)
g<<-1;
else
g<<dr;
}
else
if(q==1){
st=1;dr=m;
while(st<=dr){
mid=(st+dr)/2;
if(x<v[mid])
dr=mid-1;
else
st=mid+1
}
g<<dr;
}
else
if(q==2){
st=1;dr=m;
while(st<=dr){
mid=(st+dr)/2;
if(x<=v[mid])
dr=mid-1;
else
st=mid+1
}
g<<st;
}
}
return 0;
}