Cod sursa(job #1806159)
Utilizator | Data | 14 noiembrie 2016 21:28:50 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream cin("cautbin.in");
ofstream cout("cautbin.out");
int a[100100],m,n,x,y;
int main()
{
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
cin >> m;
while(m--)
{
cin >> y >> x;
if (y == 0)
{
y = upper_bound(a,a+n,x) - a;
if (a[y - 1] == x && y != 0) cout << y << "\n";
else cout << "-1\n";
}
else
{
if (y == 1)cout << upper_bound(a,a+n,x) - a << "\n";
else cout << lower_bound(a,a+n,x) - a + 1<< "\n";
}
}
}