Pagini recente » Cod sursa (job #2838241) | Cod sursa (job #111783) | Cod sursa (job #3264587) | Cod sursa (job #922463) | Cod sursa (job #303773)
Cod sursa(job #303773)
#include<cstdio>
int N;
int M;
int a[100];
int lg[100];
int rmq[100][100];
int getmin(int x,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("%d %d",&N,&M);
for(i=1;i<=N;i++){
scanf("%d",&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]);
}
}
int x,y,t,u,v;
for(i=1;i<=M;i++){
scanf("%d %d",&x,&y);
u=y-x+1;
v=lg[u];
t=u-(1<<v);
printf("%d \n",getmin(rmq[v][x],rmq[v][x+t]));
}
return 0;
}