Cod sursa(job #2200420)
Utilizator | Data | 1 mai 2018 12:38:52 | |
---|---|---|---|
Problema | Cautare binara | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.19 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int v[100002],a,n,k,m,x ;
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
{
fin>>a;
v[i]=a;
}
int y=3;
fin>>m;
for(int i=1; i<=m; i++)
{
fin>>k;
if(k==0)
{
fin>>y;
x=upper_bound(v +1,v+n+1 ,y)-v-1;
if(v[x]==y)
fout<<x<<'\n';
else
fout<<-1<<'\n';
}
else if(k==1)
{
fin>>y;
for(int i=y; i>=1; i--)
{
x=upper_bound(v +1,v+n+1 ,i)-v-1;
if(v[x]==i)
{
fout<<x<<'\n';
break;
}
}
}
else if(k==2)
{
fin>>y;
for(int i=y; i<=v[n]; i++)
{
x=lower_bound(v +1,v+n+1 ,i)-v;
if(v[x]==i)
{
fout<<x<<'\n';
break;
}
}
}
}
return 0;
}