Pagini recente » Cod sursa (job #30455) | Cod sursa (job #2410328) | Cod sursa (job #1240921) | Cod sursa (job #813752) | Cod sursa (job #3274041)
#include <fstream>
#include <cmath>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int n,q,dp[100005][20],sol[1000005],len,x,y;
int main()
{
in>>n>>q;
for(int i=1;i<=n;i++)
in>>dp[i][0];
for(int i=1;(1<<i)<=n;i++)
for(int j=1;j+(1<<i)-1<=n;j++)
dp[j][i]=min(dp[j][i-1],dp[j+(1<<(i-1))][i-1]);
for(int i=1;i<=q;i++)
{
in>>x>>y;
len=y-x+1;
int k=(int)log2(len);
sol[i]=min(dp[x][k],dp[y-(1<<k)+1][k]);
}
for(int i=1;i<=q;i++)
out<<sol[i]<<'\n';
return 0;
}