Pagini recente » Cod sursa (job #1705117) | Cod sursa (job #1003422) | Cod sursa (job #1756353) | Cod sursa (job #1290270) | Cod sursa (job #2650854)
#include <bits/stdc++.h>
using namespace std;
#define LMAX 18
#define NMAX 100010
int rmq[LMAX][NMAX];
int n, m;
int lg[NMAX];
int a[NMAX];
int main() {
ifstream f("rmq.in");
ofstream g("rmq.out");
int i, j, l;
f >> n >> m;
for (i = 1; i <= n; i++)
f >> a[i];
lg[1] = 0;
for (i = 2; i <= n; i++)
lg[i] = lg[i / 2] + 1;
for (i = 1; i <= n; i++)
rmq[0][i] = a[i];
for (i = 1;
(1 << i) <= n; i++)
for (j = 1; j <= n - (1 << i) + 1; j++) {
l = 1 << (i - 1);
rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + 1]);
}
int x, y, diff, sh;
for (i = 1; i <= m; i++) {
f >> x >> y;
diff = y - x + 1;
l = lg[diff];
sh = diff - (1 << l);
g << min(rmq[l][x], rmq[l][x + sh] << '\n';
}
f.close();
g.close();
return 0;
}