Cod sursa(job #2290667)
Utilizator | Data | 26 noiembrie 2018 20:14:04 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.59 kb |
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("coutbin.out");
int st,dr,mid,n,i,j,k,x,m,r;
int main()
{
fin >> n;
int v[n+5];
for (i=1;i<=n;i++){
fin >> v[i];
}
fin >> m;
for (i=1;i<=m;i++){
fin >> x >> k;
if (x==0){
st=1;
dr=n;
r=n+1;
while (st<=dr){
mid=(st+dr)/2;
if(v[mid]>k){
dr=mid-1;
r=mid;
}
else{
st=mid+1;
}
}
if (v[r-1]==k){
fout << r-1 <<"\n";
}
else{
fout << -1 <<"\n";
}
}
if (x==1){
st=1;
dr=n;
r=n+1;
while (st<=dr){
mid=(st+dr)/2;
if (v[mid]>k){
dr=mid-1;
r=mid;
}
else{
st=mid+1;
}
}
fout << r-1 <<"\n";
}
if (x==2){
st=1;
dr=n;
r=n+1;
while (st<=dr){
mid=(st+dr)/2;
if (v[mid]>=k){
dr=mid-1;
r=mid;
}
else{
st=mid+1;
}
}
fout << r <<"\n";
}
}
return 0;
}