Pagini recente » Cod sursa (job #2893360) | Cod sursa (job #1700379) | Cod sursa (job #635247) | Cod sursa (job #3000730) | Cod sursa (job #1673058)
#include <stdio.h>
#define min(a, b) ((a<b)?a:b)
#define NMAX 100001
#define LMAX 18
FILE* fin = fopen("rmq.in", "r");
FILE* fout = fopen("rmq.out", "w");
int n, m, p, q, log[LMAX], a[NMAX], rmq[NMAX][LMAX];
int main() {
fscanf(fin, "%d%d", &n, &m);
log[1] = 0;
for (int i = 2; i <= n; ++i)
log[i] = log[i / 2] + 1;
for (int i = 1; i <= n; ++i)
fscanf(fin, "%d", &rmq[i][0]);
for (int j = 1; (1 << j) <= n; ++j)
for (int i = 1; i + (1 << j) - 1 <= n; ++i)
rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << (j - 1))][j - 1]);
for (int i = 1; i <= m; ++i) {
fscanf(fin, "%d%d", &p, &q);
fprintf(fout, "%d\n", min(rmq[p][log[q - p + 1]], rmq[q - (1 << log[q - p + 1]) + 1][log[q - p + 1]]));
}
return 0;
}