Pagini recente » Cod sursa (job #1833324) | Cod sursa (job #2919488) | Cod sursa (job #2937038) | Cod sursa (job #2704619) | Cod sursa (job #1977865)
#include <stdio.h>
#include <stdlib.h>
int v[100001], r[100001][17], logg[100001];
int minim(int a, int b){
if(a<b)
return a;
return b;
}
int intreb(int a, int b){
int l=logg[b-a+1];
return minim(r[a+(1<<l)-1][l], r[b][l]);
}
int main(){
FILE *fin, *fout;
int n, m, i, j, a, b;
fin=fopen("rmq.in", "r");
fout=fopen("rmq.out", "w");
fscanf(fin, "%d%d", &n, &m);
for(i=1;i<=n;i++)
fscanf(fin, "%d", &v[i]);
for(i=1;i<=n;i++){
r[i][0]=v[i];
for(j=1;(1<<j)<=i;j++)
r[i][j]=minim(r[i-(1<<(j-1))][j-1], r[i][j-1]);
}
logg[1]=0;
for(i=2;i<=100000;i++)
logg[i]=1+logg[i/2];
for(i=0;i<m;i++){
fscanf(fin, "%d%d", &a, &b);
fprintf(fout, "%d\n", intreb(a, b));
}
fclose(fin);
fclose(fout);
return 0;
}