Cod sursa(job #2745579)
Utilizator | Mihai Crisan mihaicrisan | Data | 26 aprilie 2021 19:44:50 |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.39 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("cautbin.in");
ofstream fout("cautbin.out");
int n, m, t, x, st, dr, i;
int v[100005];
int main(){
fin >> n;
for (i = 1; i <= n; i++)
fin >> v[i];
fin >> m;
for ( ; m--; ){
fin >> t >> x;
if (t == 0){
int ok = 0;
st = 1, dr = n;
while (st <= dr){
int mid = (st + dr) / 2;
if (v[mid] == x)
ok = 1;
if (v[mid] <= x)
st = mid + 1;
else
dr = mid - 1;
}
if (ok)
fout << dr << '\n';
else
fout << -1 << '\n';
}
else if (t == 1){
st = 1, dr = n;
while (st <= dr){
int mid = (st + dr) / 2;
if (v[mid] <= x)
st = mid + 1;
else
dr = mid - 1;
}
fout << dr << '\n';
}
else{
st = 1, dr = n;
while (st <= dr){
int mid = (st + dr) / 2;
if (v[mid] >= x)
dr = mid - 1;
else
st = mid + 1;
}
fout << st << '\n';
}
}
return 0;
}