Cod sursa(job #2713531)
Utilizator | Data | 28 februarie 2021 10:57:25 | |
---|---|---|---|
Problema | Cautare binara | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.39 kb |
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int v[100001];
int main()
{
int x,st,dr,n,mij,i,sol,m,t;
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
fin>>m;
for(i=1;i<=m;i++){
fin>>t>>x;
if(t==0){
st=1;
dr=n;
sol=-1;
while(st<=dr){
mij=(st+dr)/2;
if(v[mij]>x)
dr=mij-1;
else{
if(v[mij]==x)
sol=mij;
st=mij+1;
}
}
fout<<sol<<endl;
}
if(t==1){
sol=-1;
st=1;
dr=n;
while(st<=dr){
mij=(st+dr)/2;
if(v[mij]<=x){
sol=mij;
st=mij+1;
}
else
dr=mij-1;
}
fout<<sol<<endl;
}
if(t==2){
sol=-1;
st=1;
dr=n;
while(st<=dr){
mij=(st+dr)/2;
if(v[mij]>=x){
sol=mij;
dr=mij-1;
}
else
st=mij+1;
}
fout<<sol<<endl;
}
}
return 0;
}