Pagini recente » Cod sursa (job #2355800) | Cod sursa (job #52751) | Cod sursa (job #552235) | Cod sursa (job #154535) | Cod sursa (job #1424785)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int v[1000001];
int main()
{
int n,i,m,k,x,pas;
in>>n;
for(i=1;i<=n;i++)
in>>v[i];
in>>m;
while(m){
in>>k>>x;
i=0;
pas=1<<16;
if(k==0 || k==1){
while(pas){
if(i+pas<=n && v[i+pas]<=x)
i+=pas;
pas/=2;
}
if(k==0 && v[i]!=x)
out<<i<<'\n';
}
else {
while(pas){
if(i+pas<=n && v[i+pas]<x)
i+=pas;
pas/=2;
}
i++;
}
out<<i<<'\n';
m--;
}
in.close();
out.close();
return 0;
}