Cod sursa(job #2565885)
Utilizator | Data | 2 martie 2020 17:31:28 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.85 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("cautbin.in");
ofstream fout ("cautbin.out");
int n, i, x, a, m, ans, st, dr, mij;
int v[100001];
int main()
{
cin >> n;
for(i = 1; i <= n; i++)
cin >> v[i];
cin >> m;
for(i = 1; i <= m; i++)
{
cin >> a >> x;
if(a == 0)
{
st = 1;
dr = n;
ans = 0;
while(st <= dr)
{
mij = (st + dr) / 2;
if(v[mij] == x)
{
ans = mij;
st = mij + 1;
}
else
{
if(v[mij] < x)
st = mij + 1;
else
dr = mij - 1;
}
}
if(ans != 0)
cout << ans << "\n";
else
cout << -1 << "\n";
}
if(a == 1)
{
st = 1;
dr = n;
ans = 0;
while(st <= dr)
{
mij = (st + dr) / 2;
if(v[mij] <= x)
{
ans = mij;
st = mij + 1;
}
else
dr = mij - 1;
}
cout << ans << "\n";
}
if(a == 2)
{
st = 1;
dr = n;
ans = 0;
while(st <= dr)
{
mij = (st + dr) / 2;
if(v[mij] >= x)
{
ans = mij;
dr = mij - 1;
}
else
st = mij + 1;
}
cout << ans << "\n";
}
}
return 0;
}