Cod sursa(job #3376006)
| Utilizator | Data | 15 noiembrie 2026 07:56:11 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream cin("cautbin.in");
ofstream cout("cautbin.out");
int a[100000];
int main()
{
int m,n;
cin>>n;
for(int i=0;i<n;cin>>a[i++]);
for(cin>>m;m--;) {
int i,j;
if(cin>>i>>j,!i) {
int k=upper_bound(a,a+n,j)-a;
cout<<(a[k-1]==j?k:-1)<<'\n';
} else
cout<<(i<2?upper_bound(a,a+n,j)-a:lower_bound(a,a+n,j)-a+1)<<'\n';
}
return 0;
}