Pagini recente » Cod sursa (job #869406) | Cod sursa (job #2676202) | Cod sursa (job #2281619) | Cod sursa (job #2094771) | Cod sursa (job #1430319)
#include <fstream>
using namespace std;
ifstream f("cautbin.in"); ofstream g("cautbin.out");
int a[100001];
int main()
{ int n,q,i;
f>>n;
for(i=1; i<=n; i++) f>>a[i];
f>>q;
while(q--)
{ int t,x,st,dr,m;
f>>t>>x;
switch(t)
{ case 0 : st=1; dr=n;
while(st<=dr)
{ m=(st+dr)/2;
if(a[m]<=x)
st=m+1;
else
dr=m-1;
}
if(x==a[dr]) g<<dr<<'\n'; else g<<"-1\n";
break;
case 1 : st=1; dr=n;
while(st<=dr)
{ m=(st+dr)/2;
if(a[m]<=x) st=m+1; else dr=m-1;
}
g<<dr<<'\n';
break;
case 2 : st=1; dr=n;
while(st<=dr)
{ m=(st+dr)/2;
if(a[m]<x) st=m+1; else dr=m-1;
}
g<<st<<'\n';
}
}
g.close();
return 0;
}