Pagini recente » Cod sursa (job #2086731) | Cod sursa (job #1698772) | Cod sursa (job #1805924) | Cod sursa (job #312433) | Cod sursa (job #898461)
Cod sursa(job #898461)
#include <iostream>
#include <fstream>
using namespace std;
fstream fin("cautbin.in",ios::in);
fstream fout("cautbin.out",ios::out);
int i,t,a,N,M,n[100001];
long zero(int a){
int st,dr,mij;
st=1;dr=N+1;
while(st<=dr){
mij=st+(dr-st)/2;
if(a<n[mij]) { dr=mij-1;}
if(a>=n[mij]) { st=mij+1;}
}
if(a==n[mij])return mij;else return -1;}
long unu(int a){
int st,dr,mij;
st=1;dr=N+1;
while(st<=dr){
mij=st+(dr-st)/2;
if(a>n[mij]) { dr=mij-1;}
if(a==n[mij]){ st=mij+1;}
if(a<n[mij]){ dr=mij-1;}}
if(a>=n[mij])return mij;else return -1;}
long doi(int a){
int st,dr,mij;
st=1;dr=N+1;
while(st<dr){
mij=(st+dr)/2;
if(n[mij]<a){st=mij+1;}
if(n[mij]>a){dr=mij;}
if(n[mij]==a){dr=mij;}}
mij=(st+dr)/2;
if(n[mij]<a)mij++;
return mij;}
int main(){
fin>>N;
for(i=1;i<=N;i++){fin>>n[i];}
fin>>M;
for(i=1;i<=M;i++){fin>>t>>a;
if(t==0){fout<<zero(a)<<endl;}
if(t==1){fout<<unu(a)<<endl;}
if(t==2){fout<<doi(a)<<endl;}}
fin.close();
fout.close();
return 0;
}