Cod sursa(job #2282823)
Utilizator | Data | 14 noiembrie 2018 15:48:11 | |
---|---|---|---|
Problema | Cautare binara | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.67 kb |
#include <cstdio>
#include <iostream>
using namespace std;
const int N=100000+5;
int n;
int v[N];
int main()
{
freopen("cautbin.in","r",stdin);
freopen("cautbin.out","w",stdout);
scanf("%d",&n);
for(register int i=1;i<=n;i++)
{
scanf("%d",&v[i]);
}
register int q;
scanf("%d",&q);
while(q--)
{
register int t,x;
scanf("%d%d",&t,&x);
register int st=1,dr=n,ans=-1,med;
if(t==0)
{
while(st<=dr)
{
med=(st+dr)/2;
if(v[med]==x)
{
ans=med;
}
if(v[med]<=x)
{
st=med+1;
}
else
{
dr=med-1;
}
}
printf("%d\n",ans);
}
if(t==1)
{
while(st<=dr)
{
med=(st+dr)/2;
if(v[med]<=x)
{
ans=med;
st=med+1;
}
else
{
dr=med-1;
}
}
printf("%d\n",ans);
}
if(t==2)
{
while(st<=dr)
{
med=(st+dr)/2;
if(v[med]>=x)
{
ans=med;
dr=med-1;
}
else
{
st=med+1;
}
}
printf("%d\n",ans);
}
}
return 0;
}