Pagini recente » Cod sursa (job #3366015) | Cod sursa (job #3366469) | Cod sursa (job #3366732) | Cod sursa (job #3366016) | Cod sursa (job #3366012)
#include <fstream>
#include <vector>
using namespace std;
const int INF = 1e6;
int main() {
ifstream in("rmq.in");
int n, q;
in >> n >> q;
vector <int> log_2(n + 1, 0);
log_2[1] = 0;
for (int i = 2; i <= n; i++) {
log_2[i] = log_2[i >> 1] + 1;
}
vector <vector<int>> r(1 + log_2[n], vector<int>(n, INF));
for (int j = 1; j <= n; j++) {
in >> r[0][j];
}
for (int i = 1; i <= log_2[n]; i++) {
for (int j = (1 << i); j <= n; j++) {
int p = 1 << (i - 1);
r[i][j] = min(r[i-1][j-p], r[i-1][j]);
}
}
ofstream out("rmq.out");
for (int i = 0; i < q; i++) {
int st, dr;
in >> st >> dr;
int l = log_2[dr-st+1];
int p = 1 << l;
out << min(r[l][st+p-1], r[l][dr]) << "\n";
}
in.close();
out.close();
return 0;
}