Pagini recente » Cod sursa (job #1437138) | Cod sursa (job #2413082) | Cod sursa (job #2150933) | Cod sursa (job #815156) | Cod sursa (job #2284639)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int NMax = 1e6 + 5;
const int logNMax = 20;
int RMQ[logNMax][NMax];
int main() {
ios::sync_with_stdio(false);
int n, t;
fin >> n >> t;
for(int i = 1; i <= n; i++) fin >> RMQ[0][i];
for(int i = 1; i <= log2(n); i++) {
for(int j = 1; j + (1 << i) - 1 <= n; j++) {
RMQ[i][j] = min(RMQ[i - 1][j], RMQ[i - 1][j + (1 << (i - 1))]);
}
}
while(t--) {
int x, y;
fin >> x >> y;
int k = log2(y - x);
fout << min(RMQ[k][x], RMQ[k][y - (1 << k) + 1]) << "\n";
}
return 0;
}