Pagini recente » Cod sursa (job #1389053) | Cod sursa (job #2368908) | Cod sursa (job #2120395) | Cod sursa (job #1518242) | Cod sursa (job #2456457)
#include <bits/stdc++.h>
using namespace std;
int rmq[20][100005];
int lg[100005];
int main() {
ios_base::sync_with_stdio(false);
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int n, m;
cin >> n >> m;
lg[0] = -1;
for (int i = 1; i <= n; ++i) lg[i] = lg[i >> 1] + 1;
for (int i = 1; i <= n; ++i) cin >> rmq[0][i];
for (int i = 1; (1 << i) <= 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 (m--) {
int x, y;
cin >> x >> y;
int p = lg[y - x + 1];
cout << min(rmq[p][x], rmq[p][y - (1 << p) + 1]) << "\n";
}
}