Cod sursa(job #2809399)
| Utilizator | Data | 26 noiembrie 2021 21:56:15 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 1.05 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n,i,v[100005],m,cer,x,j,st,dr,poz;
int main()
{
f>>n;
for(i=1;i<=n;i++)f>>v[i];
f>>m;
for(j=1;j<=m;j++){f>>cer>>x;
if(cer==0){
st=1;
dr=n;
poz=-1;
while(st<=dr){
m=(st+dr)/2;
if(x>=v[m]){
if(x==v[m]) poz=m;
st=m+1;
}
else dr=m-1;}
g<<poz<<'\n';}
else if(cer==1){
st=1;
dr=n;
poz=-1;
while(st<=dr){
m=(st+dr)/2;
if(v[m]<=x){
poz=m;
st=m+1;
}
else dr=m-1;}
g<<poz<<'\n';}
else if(cer==2){
st=1;
dr=n;
poz=0;
while(st<=dr){
m=(st+dr)/2;
if(x<=v[m]){
poz=m;
dr=m-1;
}
else st=m+1;}
g<<poz<<'\n';}
}
return 0;
}
