Pagini recente » Cod sursa (job #1116560) | Cod sursa (job #1863390) | Cod sursa (job #2960869) | Cod sursa (job #573998) | Cod sursa (job #2898184)
#include <fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
const int NMAX = 1e5;
const int LMAX = 16;
int r[LMAX + 1][NMAX + 1], log[NMAX];
int main()
{
int n, q;
in >> n >> q;
for (int j = 1; j <= n; j++)
{
in >> r[0][j];
}
for (int i = 1; (1 << i) <= n; i++)
{
for (int j = (1 << i); j <= n; j++)
{
int p = (1 << (i - 1));
r[i][j] = min(r[i - 1][j - p], r[i - 1][j]);
}
}
log[1] = 0;
for (int i = 2; i <= n; i++)
{
log[i] = 1 + log[i / 2];
}
for (int i = 1; i <= q; i++)
{
int st, dr;
in >> st >> dr;
int l, p, rez;
l = log[dr - st + 1];
p = (1 << l);
rez = min(r[l][st + p - 1], r[l][dr]);
out << rez << "\n";
}
return 0;
}