Pagini recente » Cod sursa (job #1645392) | Cod sursa (job #1720778) | Cod sursa (job #2222480) | Cod sursa (job #1108353) | Cod sursa (job #2223053)
#include <cstdio>
int main()
{
int N, M, v[100005], log2N;
int task, value, i, lg;
freopen("cautbin.in", "r", stdin);
freopen("cautbin.out", "w", stdout);
scanf("%d", &N);
for(i = 1; i <= N; ++i)
{
scanf("%d", &v[i]);
}
for(log2N = 1; log2N <= N; log2N <<= 1);
scanf("%d", &M);
for(; M; --M)
{
scanf("%d %d", &task, &value);
if(task < 2)
{
for(lg = log2N, i = 0; lg; lg >>= 1)
{
if(i + lg <= N && v[i + lg] <= value)
{
i += lg;
}
}
if(!task && v[i] != value)
{
printf("-1\n");
}
else
{
printf("%d\n", i);
}
}
for(lg = log2N, i = N; lg; lg >>= 1)
{
if(i - lg > 0 && v[i - lg] >= value)
{
i -= lg;
}
}
printf("%d\n", i);
}
return 0;
}