Pagini recente » Cod sursa (job #2460439) | Cod sursa (job #1845231) | Concursuri organizate de infoarena | Cod sursa (job #2236762) | Cod sursa (job #2226317)
#include <stdio.h>
#define min(x, y) y ^ ((x ^ y) & -(x < y))
#define IN_BUFFER_SIZE 0xE04DE0
__attribute__((always_inline)) int get_number()
{
static char inBuffer[IN_BUFFER_SIZE];
static int p = IN_BUFFER_SIZE - 0x1; int number = 0x0;
inBuffer[p] > 0x2F || ++p != IN_BUFFER_SIZE || (fread(inBuffer, 0x1, IN_BUFFER_SIZE, stdin), p = 0x0);
for(; inBuffer[p] > 0x2F;)
{
number = number * 0xA + inBuffer[p] - 0x30;
++p != IN_BUFFER_SIZE || (fread(inBuffer, 0x1, IN_BUFFER_SIZE, stdin), p = 0x0);
}
return number;
}
char outBuffer[0x7A1]; ///WTF??
unsigned int p = ~0x0;
__attribute__((always_inline)) void put_number(unsigned int x)
{
unsigned int digits = x > 0x1869F ? 0x7 :
x > 0x270F ? 0x6 :
x > 0x3E7 ? 0x5 :
x > 0x63 ? 0x4 :
x > 0x9 ? 0x3 : 0x2;
for(unsigned int i = digits; --i; x /= 0xA)
{
outBuffer[p + i] = x % 0xA + 0x30;
}
outBuffer[p = p + digits] = 0xA;
}
int RMQ[0x11][0x186A1];
int main()
{
freopen("rmq.in", "r", stdin);
freopen("rmq.out", "w", stdout);
int N = get_number(), M = get_number() + 0x1;
for(int i = 0x1; i <= N; ++i)
RMQ[0x0][i] = get_number();
for(int i = 0x0; i < 0x10; ++i)
for(int j = 0x1; j < N - i; ++j)
{
int x = RMQ[i][j], y = RMQ[i][j + (0x1 << i)];
RMQ[i + 0x1][j] = min(x, y);
}
while(--M)
{
int x = get_number(), y = get_number(), z = y - x + 0x1, msb;
asm("bsrl %1, %0" : "=r"(msb) : "r"(z));
int X = RMQ[msb][x], Y = RMQ[msb][y + 0x1 - (0x1 << msb)];
put_number(min(X, Y));
}
fwrite(outBuffer, 0x1, p, stdout);
}