Pagini recente » Cod sursa (job #162104) | Cod sursa (job #848557) | Cod sursa (job #3176474) | Cod sursa (job #2471138) | Cod sursa (job #2621843)
#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n, m;
int rmq[33][33], lg[1000002];
int main() {
f >> n >> m;
for(int i = 1; i <= n; i++)
f >> rmq[0][i];
lg[1] = 0;
for(int i = 2; i <= n; i++)
lg[i] = lg[i / 2] + 1;
for(int i = 1; (1 << i) <= n; i++)
for (int j = 1; j <= n - (1 << i) + 1; j++)
rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
for (int i = 1; i <= m; i++)
{
int x, y;
f >> x >> y;
int dif = y - x + 1;
int l = lg[dif];
int s = dif - (1 << l);
g << min(rmq[l][x], rmq[l][x + s]) << '\n';
}
return 0;
}