Pagini recente » Cod sursa (job #2836166) | Cod sursa (job #3144345) | Cod sursa (job #1176652) | Cod sursa (job #2043338) | Cod sursa (job #2223092)
#include <cstdio>
__attribute__((always_inline)) unsigned int get_number()
{
static char inBuffer[0x8000];
static unsigned int p = 0x7FFF; unsigned int number = 0x0;
while(inBuffer[p] < 0x30 || inBuffer[p] > 0x39)
{
++p == 0x8000 && (fread(inBuffer, 0x1, 0x8000, stdin), p = 0x0);
}
for(;;)
{
number = number * 0xA + inBuffer[p] - 0x30;
++p == 0x8000 && (fread(inBuffer, 0x1, 0x8000, stdin), p = 0x0);
if(inBuffer[p] < 0x30 || inBuffer[p] > 0x39) break;
}
return number;
}
int main()
{
int N, M, v[100005], task, value, log2N, step, i;
freopen("cautbin.in", "r", stdin);
freopen("cautbin.out", "w", stdout);
N = get_number();
for(i = 1; i <= N; ++i)
{
v[i] = get_number();
}
for(log2N = 1; log2N <= N; log2N <<= 1);
M = get_number();
for(; M; --M)
{
task = get_number();
value = get_number();
if(task < 2)
{
for(step = log2N, i = 0; step; step >>= 1)
{
if(i + step <= N && v[i + step] <= value)
{
i += step;
}
}
if(!task && v[i] != value)
{
printf("-1\n");
}
else
{
printf("%d\n", i);
}
}
else
{
for(step = log2N, i = N; step; step >>= 1)
{
if(i - step > 0 && v[i - step] >= value)
{
i -= step;
}
}
printf("%d\n", i);
}
}
return 0;
}