Pagini recente » Cod sursa (job #1739861) | Cod sursa (job #152234) | Cod sursa (job #1362442) | Cod sursa (job #1288704) | Cod sursa (job #2822500)
#include <iostream>
#include <fstream>
#include <cmath>
#define MAX 100002
using namespace std;
int n,m,a[MAX],x,y,minm[MAX][102];
int main(void)
{
ifstream cin("rmq.in");
ofstream cout("rmq.out");
cin >> n >> m;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
for(int i = 1; i <= n; i++){
minm[i][0] = a[i];
}
for(int j = 1; j <= log2(n); j++){
for(int i = 1; i+(1<<(j-1)) <= n; i++){
minm[i][j] = min(minm[i][j-1], minm[i+(1<<(j-1))][j-1]);
}
}
for(int i = 1; i <= m; i++){
cin >> x >> y;
int len = y-x+1;
int LOG = log2(len);
cout << min(minm[x][LOG], minm[y-(1<<LOG)+1][LOG]) << endl;
}
}