Pagini recente » Cod sursa (job #1685683) | Cod sursa (job #3137171) | Cod sursa (job #2178334) | Cod sursa (job #3190513) | Cod sursa (job #3223763)
#include <fstream>
using namespace std;
ifstream cin ("rmq.in");
ofstream cout ("rmq.out");
const int MAXVAL=100100;
const int putere=20;
int v[MAXVAL+1];
int dp[MAXVAL+1][putere+1];
int log_2[MAXVAL+1];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin>>n>>m;
for (int i=1; i<=n; i++){
cin>>v[i];
}
for(int i=2;i<=n;i++){
log_2[i]=log_2[i/2]+1;
}
for (int i=1; i<=n; i++){
dp[i][0] = v[i];
}
for (int i=n; i>=1; i--){
for (int j=1;(1<<j)-i-1<=n; j++){
dp[i][j] = min(dp[i][j-1], dp[i+(1<<j-1)][j-1]);
}
}
for (int i=1; i<=m; i++){
int a, b;
cin>>a>>b;
int d = b - a + 1;
int l =log_2[d];
cout<<min(dp[a][l], dp[b-(1<<l)+1][l])<<'\n';
}
return 0;
}