Pagini recente » Cod sursa (job #1372201) | Cod sursa (job #962209) | Cod sursa (job #2696840) | Cod sursa (job #2330564) | Cod sursa (job #3262046)
#include <fstream>
#include <vector>
#include <cmath>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int n,m,a,x,y;
vector<int> v;
int dp[17][100002];
vector<int> lg;
int main()
{
cin>>n>>m;
lg.resize(n+1);
lg[1]=0;
for(int i=2;i<n;i++)
{
lg[i]=lg[i/2]+1;
}
for(int i=0;i<n;i++)
{
cin>>a;
v.push_back(a);
}
for(int i=0;i<n;i++)
dp[0][i]=v[i];
for(int i=1;(1<<i)<n;i++)
{
for(int j=0;j+(1<<i)<n;j++)
{
dp[i][j]=min(dp[i-1][j],dp[i-1][j+(1<<(i-1))]);
}
}
for(int i=0;i<m;i++)
{
cin>>x>>y;
int len=y-x+1;
int p=lg[len];
int cat=len-(1<<p);
int ans=min(dp[p][x],dp[p][x+cat]);
cout<<ans<<'\n';
}
return 0;
}