Pagini recente » Cod sursa (job #1233347) | Cod sursa (job #2417104) | Cod sursa (job #2359993) | Cod sursa (job #641696) | Cod sursa (job #2600449)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int v[100010],n;
int cautare1(int y)
{
int r=0;
for(int p=30; p>=0; p--)
if(r+(1<<p)<=n and v[r+(1<<p)]<=y)
r+=(1<<p);
return r;
}
int main()
{
int m;
f>>n;
for(int i=1; i<=n; i++)
f>>v[i];
f>>m;
for(int i=1; i<=m; i++)
{
int x,y;
f>>x>>y;
if(x==0)
{
int r=cautare1(y);
if(r!=0 and v[r]==y)
g<<r<<"\n";
else g<<-1<<"\n";
}
else
{
if(x==1)
g<<cautare1(y)<<"\n";
else
g<<cautare1(y-1)+1<<"\n";
}
}
return 0;
}