Pagini recente » Cod sursa (job #1751998) | Cod sursa (job #2258735) | Cod sursa (job #1910398) | Cod sursa (job #2365317) | Cod sursa (job #1010212)
#include <stdio.h>
#define fr(i,a,b) for(int i=a;i<b;++i)
#define N 100000
#define LOGN 20
#define min(a,b) (a<b)?a:b
int a[LOGN][N];
int log[N+1];
int exp[LOGN];
int main(){
freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
int n,m,x,y;
scanf("%i%i",&n,&m);
exp[0]=1;
log[0]=-1;
fr(i,1,LOGN) exp[i]=2*exp[i-1];
fr(i,1,n+1) log[i]=log[i/2]+1;
fr(i,0,n)scanf("%i",a[0]+i);
int l=1,lg;
fr(i,1,log[n]+1){
fr(j,0,n) a[i][j]=(j+l<n)?min(a[i-1][j],a[i-1][j+l]):a[i-1][j];
l*=2;
}
fr(i,0,m){
scanf("%i%i",&x,&y);
int l=log[y-x+1];
printf("%i\n",min(a[l][x-1],a[l][y-exp[l]]));
}
return 0;
}