Pagini recente » Cod sursa (job #2404529) | Cod sursa (job #2070101) | Cod sursa (job #1854236) | Cod sursa (job #967384) | Cod sursa (job #1371957)
#include <cstdio>
using namespace std;
int n, t, i, j, v[100010], T, m, x, p, u, ok;
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(;t;t--)
{
scanf("%d %d", &T, &x);
if(T==0)
{
p=1;
u=n;
ok=-1;
while(p<=u)
{
m=(p+u)/2;
if(v[m]<=x)
p=m+1;
else
u=m-1;
}
if(v[u]==x)
printf("%d\n", u);
else
printf("-1\n");
}
else if(T==1)
{
p=1;
u=n;
ok=-1;
while(p<=u)
{
m=(p+u)/2;
if(v[m]<=x)
p=m+1;
else
u=m-1;
}
printf("%d\n", u);
}
else
{
p=1;
u=n;
ok=-1;
while(p<=u)
{
m=(p+u)/2;
if(v[m]<x)
p=m+1;
else
u=m-1;
}
printf("%d\n", p);
}
}
return 0;
}