Pagini recente » Cod sursa (job #1888383) | Cod sursa (job #1283201) | Monitorul de evaluare | Cod sursa (job #1355359) | Cod sursa (job #1424790)
#include <fstream>
#include <cmath>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int v[100001];
int main()
{ int n,m,i,t,x,j,pas;
in>>n;
for(i=1;i<=n;i++) in>>v[i];
in>>m;
for(j=1;j<=m;j++)
{
in>>t>>x;
pas=1<<16;
i=0;
if(t==0 || t==1)
{
while(pas!=0)
{
if(i+pas<=n && v[i+pas]<=x) i+=pas;
pas/=2;
}
if(t==0&&v[i]!=x) out<<-1<<"\n";
else out<<i<<"\n";
}
else
{
while(pas!=0)
{
if(i+pas<=n && v[i+pas]<x) i+=pas;
pas/=2;
}
out<<i+1;
}
}
return 0;
}