Pagini recente » Cod sursa (job #1724226) | Cod sursa (job #1741609) | Cod sursa (job #657451) | Cod sursa (job #2901703) | Cod sursa (job #3228331)
#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
const int MAXVAL=1e5;
const int putere=20;
int log_2[MAXVAL+1],dp[putere+1][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>>dp[0][i];
}
for(int i=2;i<=n;i++){
log_2[i]=log_2[i/2]+1;
}
for(int j=1;j<=log_2[n];j++){
for(int i=1;i+(1<<j)-1<=n;i++){
dp[j][i]=min(dp[j-1][i],dp[j-1][i+1<<(j-1)]);
}
}
int a,b,l;
for(int i=1;i<=m;i++){
cin>>a>>b;
l=log_2[b-a+1];
cout<<min(dp[l][a],dp[l][b-(1<<l)+1])<<'\n';
}
}