Pagini recente » Cod sursa (job #494482) | Cod sursa (job #1286665) | Cod sursa (job #2179869) | Cod sursa (job #807150) | Cod sursa (job #1489103)
#include <stdio.h>
#include <stdlib.h>
#define min(a, b) (a<b?a:b)
#define MAXL 18
#define MAXN 100001
int rmq[MAXL][MAXN], lg[MAXN];
int main()
{
FILE *fin, *fout;
int n, m, i, j, l, a, b;
for(i=2; i<MAXN; i++)
lg[i]=lg[i/2]+1;
fin=fopen("rmq.in", "r");
fscanf(fin, "%d%d", &n, &m);
for(i=1; i<=n; i++)
fscanf(fin, "%d", &rmq[0][i]);
for(i=1; (1<<i)<=n; i++){
l=1<<(i-1);
for(j=1; j<=n-(1<<i)+1; j++)
rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j+l]);
}
fout=fopen("rmq.out", "w");
for(i=0; i<m; i++){
fscanf(fin, "%d%d", &a, &b);
l=lg[b-a+1];
fprintf(fout, "%d\n", min(rmq[l][a], rmq[l][b-(1<<l)+1]));
}
fclose(fin);
fclose(fout);
return 0;
}