Pagini recente » Cod sursa (job #2394330) | Cod sursa (job #334403) | Cod sursa (job #3203605) | Cod sursa (job #617313) | Cod sursa (job #1938274)
#include <bits/stdc++.h>
using namespace std;
#define NMAX 100002
#define LMAX 18
int rmq[LMAX][NMAX], n, m, lg[NMAX], 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+l]) ;
}
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";
}
return 0;
}