Cod sursa(job #2850971)
| Utilizator | Data | 17 februarie 2022 20:46:46 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 1.2 kb |
#include<fstream>
using namespace std;
ifstream fin ("cautbin.in");
ofstream fout ("cautbin.out");
int v[100001], n, mij, st, dr, i, x, nr, m;
int main(){
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
fin>>m;
for(i=1;i<=m;i++){
fin>>nr>>x;
st=1;
dr=n;
if(nr==0){
while(st<=dr){
mij=(st+dr)/2;
if(v[mij]<=x)
st=mij+1;
else
dr=mij-1;
}
if (v[dr]==x){
fout<<dr<<"\n";
}else{
fout<<-1<<"\n";
}
}
if(nr==1){
while(st<=dr){
mij=(st+dr)/2;
if(v[st]<=x)
st=mij+1;
else
dr=mij-1;
}
fout<<dr<<"\n";
}
if(nr==2){
while(st<=dr){
mij=(st+dr)/2;
if(v[mij]<x)
st=mij+1;
else
dr=mij-1;
}
fout<<st<<"\n";
}
}
///5
///1 3 3 3 5
///3
///0 3
///1 3
///2 3
}
