Pagini recente » Cod sursa (job #2571517) | Istoria paginii runda/nimi | Cod sursa (job #2547946) | Cod sursa (job #2291633) | Cod sursa (job #2625772)
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int rmq[33][1000001], lg[1000001], v[1000001], n, m;
int main() {
f >> n >> m;
for(int i = 1; i <= n; i++)
f >> v[i];
for(int i = 1; i <= n; i++)
rmq[0][i] = v[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 a = y - x + 1;
int l = lg[a];
int s = a - (1 << l);
g << min(rmq[l][x], rmq[l][x + s])<<endl;
}
f.close();
g.close();
return 0;
}