Pagini recente » Cod sursa (job #130671) | Cod sursa (job #50171) | Cod sursa (job #534138) | Cod sursa (job #685348) | Cod sursa (job #1689461)
#include <iostream>
#include <fstream>
#include <vector>
#include <cmath>
#define NMAX 100002
#define LMAX 18
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
long int rmq[LMAX][NMAX];
int main() {
int n,m;
in >> n >> m;
int lg = log2(n);
for(int i = 1; i <= n; i++)
in >> rmq[0][i];
for(int i = 1; i <= lg; i++)
for(int j = 1; j <= n; j++)
rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);
int x,y;
int lgx;
for(int i = 1; i <= m; i++) {
in >> x >> y;
lgx = log2(y-x+1);
out << min(rmq[lgx][x], rmq[lgx][y-(1<<lgx)+1]) << '\n';
}
return 0;
}