Pagini recente » Cod sursa (job #936160) | Cod sursa (job #1782977) | Cod sursa (job #35284) | Cod sursa (job #1225763) | Cod sursa (job #2346765)
#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
using namespace std;
vector <int> dp[100005];
int n,m,x,y;
int main()
{
freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
cin>>n>>m;
for(int i=0;i<n;++i){
cin>>x;
dp[0].push_back(x);
}
for(int i=1;(1<<i)<n;++i)
for(int j=0;j+(1<<(i-1))<n;++j)
dp[i].push_back(min(dp[i-1][j],dp[i-1][j+(1<<(i-1))]));
for(int i=0;i<m;++i){
cin>>x>>y;
int k = log2(y-x+1);
cout<<min(dp[k][x],dp[k][y-(1<<k)])<<"\n";
}
return 0;
}