Pagini recente » Cod sursa (job #633460) | Cod sursa (job #2889400) | Cod sursa (job #126147) | Cod sursa (job #2765443) | Cod sursa (job #2025413)
#include <iostream>
#include <fstream>
using namespace std;
unsigned int i,j,m,n,a[100002],t,r,k;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int caut()
{
i=0;j=n+1;
while (i!=j-1)
{
k=(i+j)/2;
if(a[k]>r)j=k;
else i=k;
}
return i;
}
int main()
{
f>>n;
for(i=1;i<=n;++i)f>>a[i];
f>>m;
for(;m>0;--m)
{
f>>t>>r;
if(t==2)--r;
k=caut();
if(t==0){if(a[i]==r)g<<i;
else g<<-1;}
else if(t==1)g<<i;
else g<<j;
g<<'\n';
}
}