Pagini recente » Cod sursa (job #204338) | Cod sursa (job #2699242) | Cod sursa (job #614373) | Cod sursa (job #2700600) | Cod sursa (job #2067088)
#include <iostream>
#include <fstream>
#define Vmax 100005
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m, l2[Vmax], v[20][Vmax], x, y, lg;
int main()
{
fin >> n >> m;
for(int i = 1; i <= n; i++)
fin >> v[0][i];
for(int i = 2; i < Vmax; i++)l2[i] = l2[i/2] + 1;
for(int i = 1; i <= l2[n]; i++)
for(int j = 1; j <= n - (1 << i) + 1; j++)
v[i][j] = min(v[i - 1][j], v[i - 1][j + (1 << (i - 1))]);
for(int i = 1; i <= m; i++)
{
fin >> x >> y;
lg = l2[y - x + 1];
fout << min(v[lg][x], v[lg][y - (1 << lg) + 1]) << '\n';
}
return 0;
}