Pagini recente » Cod sursa (job #33598) | Cod sursa (job #2007610) | Cod sursa (job #1074203) | Cod sursa (job #2526581) | Cod sursa (job #303788)
Cod sursa(job #303788)
#include<cstdio>
long int N;
long int M;
long int a[100002];
long int lg[100002];
long int rmq[20][100002];
long int getmin(long int x,long int y){
if(x<y) return x;
return y;
}
int main(){
int i,j,l;
freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
scanf("%ld %ld",&N,&M);
for(i=1;i<=N;i++){
scanf("%ld",&a[i]);
rmq[0][i]=a[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);
rmq[i][j]=getmin(rmq[i-1][j],rmq[i-1][j+l]);
}
}
long int x,y,t,u,v;
for(i=1;i<=M;i++){
scanf("%ld %ld",&x,&y);
u=y-x+1;
v=lg[u];
t=u-(1<<v);
printf("%ld \n",getmin(rmq[v][x],rmq[v][x+t]));
}
return 0;
}