Cod sursa(job #1480239)
Utilizator | Data | 2 septembrie 2015 12:27:59 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.32 kb |
# include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,m,i,v[100001],st,dr,nr,x,mij;
int main () {
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
fin>>m;
for(i=1;i<=m;i++){
fin>>nr>>x;
if(nr==0){
st=1;
dr=n;
while(st<=dr){
mij=st+(dr-st)/2;
if(v[mij]<=x)
st=mij+1;
else
dr=mij-1;
}
if(v[dr]==x)
fout<<dr<<"\n";
else
fout<<-1<<"\n";
}
else
if(nr==1){
st=1;
dr=n;
while(st<=dr){
mij=st+(dr-st)/2;
if(v[mij]<=x)
st=mij+1;
else
dr=mij-1;
}
fout<<dr<<"\n";
}
else{
st=1;
dr=n;
while(st<=dr){
mij=st+(dr-st)/2;
if(v[mij]>=x)
dr=mij-1;
else
st=mij+1;
}
fout<<st<<"\n";
}
}
return 0;
}