Pagini recente » Cod sursa (job #2640683) | Cod sursa (job #2301248) | Cod sursa (job #467794) | Cod sursa (job #2321782) | Cod sursa (job #1970552)
#include <fstream>
using namespace std;
#define NMAX 100002
#define LMAX 18
#define doi_la(a) (1 << a)
int rm[LMAX][NMAX], n, m, lg[NMAX], a[NMAX];
int main()
{
int i, j, l;
ifstream f ("rmq.in");
ofstream g ("rmq.out");
f >> n >> m;
for (i = 1; i <= n; ++i)
f >> a[i];
for (i = 2; i <= n; ++i)
lg[i] = lg[i / 2] + 1;
for (i = 1; i <= n; ++i)
rm[0][i] = a[i];
for (i = 1; doi_la(i) <=n; ++i)
for (j = 1; j <= n - doi_la(i) + 1; ++j) {
l = doi_la((i - 1));
rm[i][j] = min(rm[i - 1][j], rm[i - 1][j + l]);
}
int x, y, diff, sh;
for (i = 1; i <= m; ++i) {
f >> x >> y;
diff = y - x + 1;
l = lg[diff];
sh = diff - doi_la(l);
g << min(rm[l][x], rm[l][x + sh]) << "\n";
}
return 0;
}