Pagini recente » Cod sursa (job #2197878) | Cod sursa (job #875105) | Cod sursa (job #515611) | Cod sursa (job #2658037) | Cod sursa (job #2819142)
#include <stdio.h>
#define MAXN 100001
#define MAXLOG 16
int v[MAXN];
int a[MAXN][MAXLOG+1];
int log22[MAXN];
static inline int minim(int x, int y) {
if (x<y) {
return x;
}
return y;
}
int query(int st, int dr) {
int log;
log = log22[st-dr+1];
return minim(a[st][log], a[dr-(1<<log)+1][log]);
}
int main() {
FILE *fin, *fout;
fin = fopen("rmq.in", "r");
fout = fopen("rmq.out", "w");
int n, m, i, x, y, p;
fscanf(fin, "%d%d", &n, &m);
for (i=0; i<n; i++) {
fscanf(fin, "%d", &v[i]);
}
log22[1] = 0;
for (i=2; i<=n; i++) {
log22[i] = log22[i/2]+1;
}
for (i=0; i<n; i++) {
a[i][0] = v[i];
}
for (p=1; p<=MAXLOG; p++) {
for (i=0; i+(1<<p)-1 < n; i++) {
a[i][p] = minim(a[i][p-1], a[i+(1<<(p-1))][p-1]);
}
}
for (i=0; i<m; i++) {
fscanf(fin, "%d%d", &x, &y);
x--;
y--;
fprintf(fout, "%d\n", query(x, y));
}
fclose(fin);
fclose(fout);
return 0;
}