Pagini recente » Cod sursa (job #2375489) | Cod sursa (job #1887395) | Cod sursa (job #2638117) | Cod sursa (job #876993) | Cod sursa (job #3142157)
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
const int N = 1e5;
const int LOG = 15;
int dp[LOG + 5][N + 5];
int rmq(int st, int dr){
int logaritm = log2(dr - st);
return min(dp[logaritm][dr], dp[logaritm][st + logaritm]);
}
int main() {
int n, m;
cin >> n >> m;
for(int i = 1; i <= n; i++)
cin >> dp[0][i];
int logarici = log2(n);
for(int i = 1; i <= logarici; i++){
int power = (1 << (i - 1));
for(int j = power * 2; j <= n; j++){
dp[i][j] = min(dp[i-1][j], dp[i-1][j - power]);
}
}
for(int i = 0; i < m; i++){
int st, dr;
cin >> st >> dr;
cout << rmq(st, dr) << '\n';
}
return 0;
}