Pagini recente » Cod sursa (job #2784234) | Cod sursa (job #2116156) | Cod sursa (job #2325881) | Cod sursa (job #1885608) | Cod sursa (job #650253)
Cod sursa(job #650253)
#include <stdio.h>
int main(){
int a[11][11],i,j,k,st,sf,n,m;
freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
scanf("%d",&n);
scanf("%d",&m);
a[1][0]=0;
for(i=1;i<=n;i++){
scanf("%d",&a[1][i]);
for(j=1;j<=i;j++){
if(a[j][i-j+1]<a[j][i-j]) a[j+1][i-j]=a[j][i-j+1];
else a[j+1][i-j]=a[j][i-j];
}
}
for(k=1;k<=m;k++){
scanf("%d",&st);
scanf("%d",&sf);
printf("%d\n",a[sf-st+1][st]);
}
return 0;
}