Cod sursa(job #3166644)
Utilizator | Data | 9 noiembrie 2023 10:23:04 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.16 kb |
#include <fstream>
using namespace std;
ifstream fin ("cautbin.in");
ofstream fout ("cautbin.out");
int n ,i, q, x, m, v[100001], aux[100001], dr, st, mid;
int main(){
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
fin>>m;
for(i=1;i<=m;i++){
fin>>q>>x;
st=1;
dr=n;
if(q==0){
while(st<=dr){
mid=(st+dr)/2;
if(v[mid]<=x)
st=mid+1;
else
dr=mid-1;
}
if(v[dr]==x)
aux[i]=dr;
else
aux[i]=-1;
}
if(q==1){
while(st<=dr){
mid=(st+dr)/2;
if(v[mid]<=x)
st=mid+1;
else
dr=mid-1;
}
aux[i]=dr;
}
if(q==2){
while(st<=dr){
mid=(st+dr)/2;
if(v[mid]>=x)
dr=mid-1;
else
st=mid+1;
}
aux[i]=st;
}
}
for(i=1;i<=m;i++)
fout<<aux[i]<<"\n";
}