Pagini recente » Cod sursa (job #347564) | Cod sursa (job #312814) | Cod sursa (job #1423714) | Cod sursa (job #2454664) | Cod sursa (job #1737869)
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int i,n,m,c,x,v[100010],lo,hi,mi;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
f>>m;
for(;m;m--)
{
f>>c>>x;
if(c!=2)
{
for(lo=0,hi=n+1;hi-lo-1;)
{
mi=(lo+hi)/2;
if(x>=v[mi])
lo=mi;
else
hi=mi;
}
if(c==1)
g<<lo<<'\n';
else
{
if(v[lo]==x)
g<<lo<<'\n';
else
g<<"-1\n";
}
continue;
}
for(lo=0,hi=n+1;hi-lo-1;)
{
mi=(lo+hi)/2;
if(x>v[mi])
lo=mi;
else
hi=mi;
}
g<<hi<<'\n';
}
return 0;
}