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