Cod sursa(job #3225270)
Utilizator | Data | 17 aprilie 2024 11:11:00 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream F("cautbin.in");
ofstream G("cautbin.out");
int n,i,a[100000],j,k;
int main()
{
for(F>>n;i<n;F>>a[i++]);
for(F>>i;F>>j>>i;j<2?k=upper_bound(a,a+n,i)-a,G<<(!j&&a[k-1]!=i?-1:k)<<'\n':G<<lower_bound(a,a+n,i)-a+1<<'\n');
return 0;
}