Pagini recente » clasament-arhiva-educationala | Borderou de evaluare (job #932012) | very.easy | Borderou de evaluare (job #201119) | Cod sursa (job #904478)
Cod sursa(job #904478)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int v[100001],n;
int cautb(int x)
{
int i=1,pas=1<<16;
while(pas!=0)
{
if(i+pas<=n && v[i+pas]<=x)
i+=pas;
pas/=2;
}
return i;
}
int main()
{
in>>n;
for(int i=1;i<=n;i++)
in>>v[i];
int m,t,x,poz;
in>>m;
for(int i=0;i<m;i++)
{
in>>t>>x;
if(t==2)
out<<cautb(x-1)+1<<endl;
else
{
poz=cautb(x);
if(t==0 && v[poz]!=x)
out<<-1<<endl;
else
out<<poz<<endl;
}
}
return 0;
}