Pagini recente » Cod sursa (job #66286) | Cod sursa (job #985029) | Cod sursa (job #3330186) | Cod sursa (job #3329019) | Cod sursa (job #3352602)
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int NMax = 1e5;
const int logNMax = 20;
int rmq[NMax][logNMax];
void calculeazaMat(int n) {
for (int j = 1; j <= log2(n); j++) {
for (int i = 0; i + (1 << j) <= n; i++) {
rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << (j - 1))][j - 1]);
}
}
}
int query(int i, int j) {
int k = log2(j - i + 1);
return min(rmq[i][k], rmq[j - (1 << k) + 1][k]);
}
int main() {
int n, m;
fin >> n >> m;
for (int i = 0; i < n; i++) {
fin >> rmq[i][0];
}
calculeazaMat(n);
for (int i = 0; i < m; i++) {
int x, y;
fin >> x >> y;
fout << query(x - 1, y - 1) << "\n";
}
fin.close();
fout.close();
return 0;
}