Pagini recente » Cod sursa (job #785560) | Cod sursa (job #2565120) | Cod sursa (job #2162644) | Cod sursa (job #1916174) | Cod sursa (job #2075813)
#include <bits/stdc++.h>
const int NMAX = 100005;
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n, m, v[NMAX], ok, sol;
void bs(int val) {
int p=1, i=0;
while(p*2<=n)
p=p<<1;
while(p) {
if(i+p<=n && v[i+p]<=val)
i=i+p;
p=p/2;
}
if(v[i]==val) {
ok=1;
sol=i;
}
else
if(v[i]<val)
sol=i;
}
int main() {
int i, q, x;
fin>>n;
for(i=1; i<=n; i++)
fin>>v[i];
fin>>m;
for(i=1; i<=m; i++) {
fin>>q>>x;
ok=0;
bs(x);
if(q==0) {
if(ok==1)
fout<<sol<<'\n';
}
if(q==1)
fout<<sol<<'\n';
if(q==2) {
if(ok==1)
fout<<sol<<'\n';
else
fout<<sol+1<<'\n';
}
}
return 0;
}