Cod sursa(job #2099219)
Utilizator | Data | 4 ianuarie 2018 10:58:31 | |
---|---|---|---|
Problema | Cautare binara | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.45 kb |
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,i,p,u,cer,x,m,mid;
int v[100001];
int main(){
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
fin>>m;
for(i=1;i<=m;i++){
fin>>cer;
fin>>x;
if(cer==0){
p=1;
u=n;
while(p<=u){
mid=(p+u)/2;
if(x>=v[mid]){
p=mid+1;
}
else{
u=mid-1;
}
}
if(v[u]==x) {
fout<<u;
fout<<endl;
}
else{
fout<<-1;
fout<<endl;
}
}
if(cer==1){
p=1;
u=n;
while(p<=u){
mid=(p+u)/2;
if(x>=v[mid]){
p=mid+1;
}
else{
u=mid-1;
}
}
fout<<u;
fout<<endl;
}
if(cer==2){
p=1;
u=n;
while(p<=u){
mid=(p+u)/2;
if(x<=v[mid]){
u=mid-1;
}
else{
p=mid+1;
}
}
fout<<p;
fout<<endl;
}
}
return 0;
}