Pagini recente » Cod sursa (job #438909) | Cod sursa (job #1025731) | Borderou de evaluare (job #1991036) | Cod sursa (job #1992047) | Cod sursa (job #1999963)
#include <bits/stdc++.h>
using namespace std;
int i,c,n,x,t,v[100001],poz;
int main()
{
freopen("cautbin.in","r",stdin);
freopen("cautbin.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++) scanf("%d",&v[i]);
scanf("%d",&t);
for(i=1;i<=t;i++)
{
scanf("%d%d",&c,&x);
if(c==0)
{
poz=upper_bound(v+1,v+n+1,x)-v;
if(v[poz-1]==x) printf("%d\n",poz-1);
else
printf("-1\n");
}
if(c==1)
{
poz=upper_bound(v+1,v+n+1,x)-v;
printf("%d\n",poz-1);
}
if(c==2)
{
poz=lower_bound(v+1,v+n+1,x)-v;
printf("%d\n",poz);
}
}
return 0;
}