Pagini recente » Cod sursa (job #1257409) | Cod sursa (job #1852448) | Cod sursa (job #1856946) | Cod sursa (job #326540) | Cod sursa (job #2753925)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
#define NMAX 100010
#define LMAX 18
long int rmq[LMAX][NMAX];
long int lg[NMAX];
int main()
{
long int n, m, l;
fin>>n>>m;
lg[1] = 0;
for(int i = 2; i <= n; i++)
lg[i] = lg[i/2] + 1;
for(int i = 1; i <= n; i++)
fin>>rmq[0][i];
for(int i = 1; (1 << i) <= n; ++i)
for(int 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]);
}
long int x, y, dif, sh;
for(int i = 1; i <= m; i++)
{
fin>>x>>y;
dif = y - x + 1;
l = lg[dif];
sh = dif - (1 << l);
fout << min(rmq[l][x], rmq[l][x + sh])<<'\n';
}
}