Pagini recente » Cod sursa (job #2590159) | Cod sursa (job #1598995) | Cod sursa (job #2037077) | Cod sursa (job #1585333) | Cod sursa (job #3037477)
#include <bits/stdc++.h>
using namespace std;
int rmq[18][100001];
int lg[100001];
int main(void){
ofstream cout("rmq.out");
ifstream cin("rmq.in");
int n,m;
cin >> n >> m;
for(int i = 1;i<=n;i++){
cin >> rmq[0][i]; /// secventa de 1
}
for(int i = 1; (1<<i)<= n;i++){
for(int j = 1;j + (1<<(i-1)) <= n;j++){
rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j + (1<<(i-1))]);
}
}
lg[1] = 0;
for(int i = 2;i<=n;i++){
lg[i] = 1 + lg[i / 2];
}
while(m--){
int x, y, e, len;
cin >> x >> y;
e = lg[y - x + 1];
len = (1<<e);
cout << min(rmq[e][x], rmq[e][y - len + 1]) << '\n';
}
}