Pagini recente » Istoria paginii utilizator/daniel_2009 | Cod sursa (job #3358789)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m;
int a[100005];
int e[100005], pows[30], rmq[30][100005];
void BuildSparseTable() {
for (int i = 2; i <= n; i++) {
e[i] = e[i / 2] + 1;
}
pows[0] = 1;
for (int i = 1; i <= e[n]; i++) {
pows[i] = pows[i - 1] * 2;
}
for (int i = 1; i <= n; i++) {
rmq[0][i] = a[i];
}
for (int i = 1; i <= e[n]; i++) {
for (int j = 1; j <= n - pows[i] + 1; j++) {
rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + pows[i - 1]]);
}
}
}
int Query(int x, int y) {
int length = (y - x + 1), power = e[length];
return min(rmq[power][x], rmq[power][y - pows[power] + 1]);
}
int main() {
int x, y;
fin >> n >> m;
for (int i = 1; i <= n; i++) {
fin >> a[i];
}
BuildSparseTable();
for (int i = 1; i <= m; i++) {
fin >> x >> y;
fout << Query(x, y) << "\n";
}
}