Pagini recente » Cod sursa (job #1465438) | Cod sursa (job #1783634) | Cod sursa (job #2850190) | Cod sursa (job #2758483) | Cod sursa (job #2171025)
#include <fstream>
using namespace std;
const int L=16, N=100001;
int v[N], n;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
int caut0(int x){
int r=0, pas=1<<L;
while(pas!=0){
if(r+pas<=n && v[r+pas]<=x){
r+=pas;
}
pas/=2;
}
if(r==0 || v[r]<x){
r=-1;
}
return r;
}
int caut1(int x){
int r=0, pas=1<<L;
while(pas!=0){
if(r+pas<=n && v[r+pas]<=x){
r+=pas;
}
pas/=2;
}
return r;
}
int caut2(int x){
int r=0, pas=1<<L;
while(pas!=0){
if(r+pas<=n && !(v[r+pas]>=x)){
r+=pas;
}
pas/=2;
}
r++;
return r;
}
int main(){
int m, x, a;
in>>n;
for(int i=1; i<=n; i++){
in>>v[i];
}
in>>m;
for(int i=1; i<=m; i++){
in>>a>>x;
if(a==0){
out<<caut0(x)<<"\n";
}
if(a==1){
out<<caut1(x)<<"\n";
}
if(a==2){
out<<caut2(x)<<"\n";
}
}
return 0;
}