Pagini recente » Cod sursa (job #3154336) | Cod sursa (job #1614765) | Cod sursa (job #642826) | Cod sursa (job #2388192) | Cod sursa (job #2068452)
#include<iostream>
#include<fstream>
#include<cmath>
#define DN 100100
#define LG 20
using namespace std;
fstream fin("rmq.in",ios::in),fout("rmq.out",ios::out);
int n,m,x[DN],dp[LG+3][DN],p[DN];
int main()
{
int a,b,i,j,lg,poz,l,aux=1;
fin>>n>>m;
for(i=0;(1<<i)<DN;i++) p[(1<<i)]=i;
for(i=1;i<=DN;i++) p[i]=max(p[i],p[i-1]);
for(i=1;i<=n;i++)
{
fin>>x[i];
dp[0][i]=x[i];
}
for(i=1;i<=LG;i++)
{
for(j=1;j<=n;j++)
{
poz=(1<<i)+j-1;
if(0<poz && poz<=n) dp[i][j]=min(dp[i-1][j],dp[i-1][j+(1<<(i-1))]);
}
}
for(i=1;i<=m;i++)
{
fin>>a>>b;
l=b-a+1;
aux=p[l];
fout<<min(dp[aux][a],dp[aux][b-(1<<aux)+1])<<"\n";
}
}
//xcmmdc,plantatie,euclid