Pagini recente » Cod sursa (job #1620891) | Cod sursa (job #418053) | Cod sursa (job #615822) | Cod sursa (job #549794) | Cod sursa (job #1325290)
#include<cstdio>
#define NMAX 100001
#define LMAX 19
#define min(a,b) (a<b?a:b)
using namespace std;
int n,m,i,j,l,sh,dif,x,y;
int M[LMAX][NMAX],lg[NMAX],v[NMAX];
int main()
{
freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
scanf("%d%d",&n,&m);
for (i=1;i<=n;++i) scanf("%d",&v[i]);
for (i=1;i<=n;++i) M[0][i]=i;
lg[1]=0;
for (i=2;i<=n;++i)
lg[i]=lg[i/2]+1;
for (i=1;(1<<i)<=n;++i)
for (j=1;j<=n-(1<<i)+1;++j)
{
l=1<<(i-1);
if (v[M[i-1][j]]<=v[M[i-1][j+l]]) M[i][j]=M[i-1][j];
else M[i][j]=M[i-1][j+l];
}
for (i=1;i<=m;++i)
{
scanf("%d%d",&x,&y);
dif=y-x+1;
l=lg[dif];
sh=dif-(1<<l);
printf("%d\n",min(v[M[l][x]],v[M[l][x+sh]]) );
}
}