Cod sursa(job #409248)
#include<stdio.h>
#define nmax 100002
int rmq[nmax][20], log[nmax<<1];
int n,m,x,y,k,i,j ;
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", &rmq[i][0]);
for(i=2; i<=n; i++) log[i]=log[i/2]+1;
for(j=1; (1<<j)<=n; j++)
for(i=1; i+(1<<j)<=n+1; i++)
if(rmq[i][j-1]<rmq[i+(1<<(j-1))][j-1])
rmq[i][j]=rmq[i][j-1];
else
rmq[i][j]=rmq[i+(1<<(j-1))][j-1];
for(i=1; i<=m; i++)
{ scanf("%d%d", &x, &y);
k=log[y-x+1];
if(rmq[x][k]<rmq[y+1-(1<<k)][k])
printf("%d\n", rmq[x][k]);
else
printf("%d\n", rmq[y+1-(1<<k)][k]);
}
return 0;
}