Cod sursa(job #1737888)
Utilizator | Data | 5 august 2016 11:02:04 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int i,n,m,c,x,v[100010],lo,hi,mi;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
f>>m;
for(;m;m--)
{
f>>c>>x;
pair<int*,int*> P=equal_range(v+1,v+n+1,x);
(c==0&&P.first==P.second)?g<<"-1":(c==2?g<<(int)(P.first-v):g<<(int)(P.second-v)-1);g<<'\n';
}
return 0;
}