Pagini recente » Cod sursa (job #838524) | Cod sursa (job #2662960) | Cod sursa (job #850926) | Cod sursa (job #1443565) | Cod sursa (job #1246528)
#include <stdio.h>
FILE *fin, *fout;
long n, m, x, y, s;
bool r;
int power(int a, int b)
{
if(b == 0) return 1;
if(b == 1) return a;
int temp = power(a, b/2);
return temp*temp*power(a, b%2);
}
int min(int a, int b)
{
return (a > b)?b:a;
}
int log(int a)
{
for(int i =0;;i++)
{
if(power(2, i) > a) return i-1;
}
}
int main()
{
fin = fopen("rmq.in", "r");
fout = fopen("rmq.out", "w");
fscanf(fin, "%d %d", &n, &m);
long int arr[log(n)][n];
s = n;
for(int i =0; i<= log(n);r = 1, s-=power(2, i), i++)
{
for(int j = 0; j< s; j++)
{
if(r == 0)
{
fscanf(fin, "%d", &arr[i][j]);
}
else arr[i][j] = min(arr[i-1][j], arr[i-1][j+power(2, i-1)]);
}
}
for(int i =0; i< m; i++)
{
fscanf(fin, "%d%d", &x, &y);
fprintf(fout, "%d\n", min(arr[log(y-x)][x-1], arr[log(y-x)][y - power(2, log(y-x))]));
}
return 0;
}