Pagini recente » Cod sursa (job #2301831) | Cod sursa (job #812833) | Cod sursa (job #2186939) | Cod sursa (job #2969081) | Cod sursa (job #2146057)
#include <cstdio>
using namespace std;
int n, m;
int a[100002];
int tip01(int l, int x, int tip)
{
int i;
for(l, i=0;l;l>>=1)
if(i+l<=n && a[i+l]<=x)
i+=l;
if(a[i]!=x && tip==0)
return -1;
return i;
}
int tip2(int l, int x, int tip)
{
int i;
for(l, i=n;l;l>>=1)
if(i - l >0 && a[i - l] >= x)
i-=l;
return i;
}
int main()
{
freopen("cautbin.in", "r", stdin);
freopen("cautbin.out", "w", stdout);
scanf("%d ", &n);
for(int i=1;i<=n;i++)
scanf("%d ", &a[i]);
int lg=1;
for(lg; lg<=n; lg<<=1);
int tip, x;
scanf("%d", &m);
for(int i=1; i<=m; i++)
{
scanf("%d %d", &tip, &x);
if(tip!=2)
printf("%d\n", tip01(lg, x, tip));
else
printf("%d\n", tip2(lg,x,tip));
}
return 0;
}