Pagini recente » Cod sursa (job #2804081) | Cod sursa (job #513492) | Rating Ciobotaru Mihnea (mihnea_ciobotaru) | Cod sursa (job #1429142) | Cod sursa (job #3235416)
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 1e5;
int v[NMAX + 1];
int rmq[NMAX + 1][18];
int Log[NMAX + 1];
ifstream f("rmq.in");
ofstream g("rmq.out");
int main() {
int n, m;
f >> n >> m;
//cout << n << '\n';
for(int i = 1; i <= n; i++) {
f >> v[i];
}
Log[1] = 0;
for(int i = 2; i <= n; i++) {
Log[i] = Log[i / 2] + 1;
}
for(int i = 1; i <= n; i++) {
rmq[i][0] = v[i];
}
for(int j = 1; j <= Log[n]; j++) {
for(int i = 1; i + (1 << j) - 1 <= n; i++) {
rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << (j - 1))][j - 1]);
}
}
for(int i = 1; i <= m; i++) {
int a, b;
f >> a >> b;
int k = Log[b - a + 1];
g << min(rmq[a][k], rmq[b - (1 << k) + 1][k]) << '\n';
}
return 0;
}