Cod sursa(job #1506191)
Utilizator | Data | 20 octombrie 2015 09:02:11 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.36 kb |
#include<fstream>
using namespace std;
int n,v[10001],st,dr,x,op,m,mid,i;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int main(){
fin>>n;
for(i=1;i<=n;i++){
fin>>v[i];
}
fin>>m;
for(i=1;i<=m;i++){
fin>>op>>x;
if(op==0){
dr=n;
st=1;
while(st<=dr){
mid=(st+dr)/2;
if(v[mid]>x){
dr=mid-1;
}
else{
st=mid+1;
}
}
if(v[dr]==x){
fout<<dr<<"\n";
} else {
fout<<"-1";
}
}
if(op==1){
dr=n;
st=1;
while(st<=dr){
mid=(st+dr)/2;
if(v[mid]>x){
dr=mid-1;
}
else{
st=mid+1;
}
}
fout<<dr<<"\n";
}
if(op==2){
dr=n;
st=1;
while(st<=dr){
mid=(st+dr)/2;
if(v[mid]<x){
st=mid+1;
}
else{
dr=mid-1;
}
}
fout<<st<<"\n";
}
}
return 0;
}