Pagini recente » Cod sursa (job #2188124) | Monitorul de evaluare | Borderou de evaluare (job #1071596) | Cod sursa (job #83285) | Cod sursa (job #3353333)
#include <fstream>
#include <iostream>
#include <cmath>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int mat[100000][20];
int n, m;
int rmq(int i, int j) {
int k = log2(j - i + 1);
return min(mat[i][k], mat[j - (1 << k) + 1][k]);
}
int main() {
fin >> n >> m;
cout << n << " " << m << "\n";
for(int i = 0; i < n; i ++) {
fin >> mat[i][0];
}
for(int j = 0; j <= log2(n); j++) {
for(int i = 0; i + (1 << j) <= n; i++) {
mat[i][j] = min(mat[i][j-1], mat[i + (1 << (j-1))][j-1]);
}
}
for(int i = 0; i < m ; i++) {
int x, y;
fin >> x >> y;
fout << rmq(x - 1, y - 1) << "\n";
}
}