Pagini recente » Cod sursa (job #2574615) | Cod sursa (job #3289449) | Cod sursa (job #3348560) | Cod sursa (job #763862) | Cod sursa (job #3352592)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
const int NMAX = 1e5;
const int LOGMAX = 20;
int rmq[NMAX][LOGMAX];
void preprocesare(int v[], int n) {
for (int i = 0; i < n; i++) {
rmq[i][0] = v[i];
}
for (int j = 1; j <= log2(n); j++) {
for (int i = 0; i < n; i++) {
if (i + (1 << j) <= n) {
rmq[i][j] = min(rmq[i][j-1], rmq[i+(1 << (j - 1))][j-1]);
}
}
}
}
int interogare(int x, int y) {
int putere = log2(y - x + 1);
return min(rmq[x][putere], rmq[y - (1 << putere) + 1][putere]);
}
int main()
{
int n, m;
in >> n >> m;
int v[n];
for (int i = 0; i < n; i++) {
in >> v[i];
}
preprocesare(v, n);
for (int i = 0; i < m; i++) {
int x, y;
in >> x >> y;
out << interogare(x - 1, y - 1) << endl;
}
return 0;
}