Pagini recente » Cod sursa (job #1975157) | Cod sursa (job #733923) | Cod sursa (job #1827579) | Cod sursa (job #227118) | Cod sursa (job #2755304)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int rmq[17][100001], lg[100001], v[100001], 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 + (1 << i) - 1 <= n; j++)
rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i-1))]);
for (int i = 0; i < m; i++)
{
int x, y;
f >> x >> y;
int l = y - x + 1;
int log = lg[l];
int s = l - (1 << log);
g << min(rmq[s][x], rmq[log][x + s])<<'\n';
}
return 0;
}