Pagini recente » Cod sursa (job #1310810) | Cod sursa (job #830651) | Cod sursa (job #314135) | Cod sursa (job #978704) | Cod sursa (job #1426122)
#include <fstream>
using namespace std;
ifstream f("cautbin.in"); ofstream g("cautbin.out");
int a[100001];
int main()
{ int n,m,i,t,x,j,step;
in>>n;
for(i=1;i<=n;i++) f>>v[i];
f>>m;
for(j=1;j<=m;j++)
{
f>>t>>x;
step=1<<16;
i=0;
if(t==0 || t==1)
{
while(step!=0)
{
if(i+step<=n && a[i+step]<=x) i+=step;
step/=2;
}
if(t==0&&a[i]!=x) g<<-1<<"\n";
else g<<i<<"\n";
}
else
{
while(step!=0)
{
if(i+step<=n && a[i+step]<x) i+=step;
step/=2;
}
g<<i+1<<"\n";
}
}
return 0;
}