Pagini recente » Istoria paginii runda/ty | Cod sursa (job #1226539) | Cod sursa (job #2645042) | Cod sursa (job #2575155) | Cod sursa (job #650259)
Cod sursa(job #650259)
#include <stdio.h>
int main(){
int a[11][11],i,j,k,st,sf,n,m;
FILE* in=fopen("rmq.in","r");
FILE* out=fopen("rmq.out","w");
fscanf_s(in,"%d",&n);
fscanf_s(in,"%d",&m);
a[1][0]=0;
for(i=1;i<=n;i++){
fscanf_s(in,"%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++){
fscanf_s(in,"%d",&st);
fscanf_s(in,"%d",&sf);
fprintf(out,"%d\n",a[sf-st+1][st]);
}
fclose(in);
fclose(out);
return 0;
}