Pagini recente » Cod sursa (job #1523044) | Cod sursa (job #1166960) | Rating bogdan horia-daniel (falselight) | Cod sursa (job #785249) | Cod sursa (job #2833981)
using namespace std;
#include<iostream>
#include<fstream>
ifstream fin("rmq.in");
ofstream fout("rmq.out");
#define DIM 100005
int rmq[20][DIM];
int n, m;
int main() {
fin >> n >> m;
for (int i = 1; i<=n; i++) {
fin >> rmq[0][i];
}
for (int exp = 1, lungime = 2; lungime <= n; lungime *= 2, exp++) {
for (int i = lungime; i<=n; i++) {
rmq[exp][i] = min(rmq[exp-1][i-lungime/2], rmq[exp-1][i]);
}
}
while (m--) {
int x, y;
fin >> x >> y;
int put = 1, e = 0;
while (put <= y-x+1) {
put *= 2;
e++;
}
put /= 2;
e--;
fout << min(rmq[e][x+put-1], rmq[e][y]) << "\n";
}
return 0;
}