Cod sursa(job #2586784)
Utilizator | Data | 21 martie 2020 15:43:42 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
long long n, m, v[200005], l, r, mid, pos, q, x;
int main()
{
fin >> n;
for(int i = 1; i <= n; i ++)
fin >> v[i];
fin >> m;
while(m --)
{
pos = -1;
fin >> q >> x;
if(q == 0){
l = 1; r = n;
while(l <= r){
mid = l + (r - l) / 2;
if(v[mid] == x)
{
pos = mid;
l = mid + 1;
}
if(v[mid] > x) r = mid - 1;
if(v[mid] < x) l = mid + 1;
}
fout << pos << "\n";
}
if(q == 1){
l = 1; r = n;
while(l <= r){
mid = l + (r - l) / 2;
if(v[mid] <= x)
{
pos = mid;
l = mid + 1;
}
else r = mid - 1;
}
fout << pos << "\n";
}
if(q == 2){
l = 1; r = n;
while(l <= r){
mid = l + (r - l) / 2;
if(v[mid] >= x){
pos = mid;
r = mid - 1;
}
else l = mid + 1;
}
fout << pos << "\n";
}
}
}