Pagini recente » Cod sursa (job #463143) | Cod sursa (job #2733970) | Istoria paginii runda/serj/clasament | Cod sursa (job #1818917) | Cod sursa (job #299576)
Cod sursa(job #299576)
#include <cstdio>
int n, m, i, j, l, x, y, p, N, Q, A, B;
int lg[100010], a[100010][18];
int main(){
FILE *f = fopen("rmq.in", "r");
FILE *g = fopen("rmq.out", "w");
fscanf(f,"%d %d",&n, &m);
for(i = 1; i <= n; i++)
fscanf(f,"%d",&a[i][0]);
p = 1;
lg[0] = 0; j = 2;
for(i = 1; i <= n; i++){
lg[i] = lg[i-1];
if(i == j){
lg[i] = p;
j = j << 1;
p++;
}
}
N = lg[n];
for(j = 1; j <= N; j++){
l = 1 << j;
for(i = 1; i <= n && i + l - 1 <= n; i++){
a[i][j] = a[i][ j - 1 ];
Q = a[ i + (l >> 1) ][j - 1];
if(a[i][j] > Q)
a[i][j] = Q;
}
}
for(i = 1; i <= m; i++){
fscanf(f,"%d %d", &x, &y);
l = lg[ y - x ];
A = a[x][ l ];
B = a[ y - ( 1 << l ) + 1 ][ l ];
if( A < B)
fprintf(g,"%d\n", A);
else
fprintf(g,"%d\n",B);
}
fclose(f);
fclose(g);
return 0;
}