Pagini recente » ana-are-mere | Cod sursa (job #2473048) | Cod sursa (job #3287788) | Termeni si conditii de utilizare a site-ului infoarena | Cod sursa (job #1373784)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("rmq.in");
ofstream g ("rmq.out");
const int NMAX = 100000 + 1;
const int LOGMAX = 17;
int n, q;
int lg2[LOGMAX], rmq[LOGMAX][NMAX];
void citeste() {
f >> n >> q;
for (int i = 1; i <= n; i++) f >> rmq[0][i];
}
void precalculeaza() {
int l;
for (int i = 2; i <= n; i++)
lg2[i] = lg2[i / 2] + 1;
for (int i = 1; (1 << i) <= n; i++) {
l = 1 << (i - 1);
for (int j = 1; j <= n - (1 << i) + 1; j++) {
rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + l]);
}
}
}
void raspunde() {
int a, b, l, secv1, secv2;
for (int i = 1; i <= q; i++) {
f >> a >> b;
l = lg2[b - a + 1];
secv1 = a;
secv2 = b + 1 - (1 << l);
g << min(rmq[l][secv1], rmq[l][secv2]) << '\n';
}
}
int main() {
citeste();
precalculeaza();
raspunde();
}