Pagini recente » Cod sursa (job #2346386) | Cod sursa (job #3132530) | Cod sursa (job #224262) | Cod sursa (job #2861782) | Cod sursa (job #1360387)
#include<cstdio>
#include<string>
using namespace std;
#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "rmq";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif
const int NMAX = 100000 + 5;
int N, M;
int RMQ[18][NMAX];
int p2[18];
int log2[NMAX];
void build() {
int i, j, p;
for(i = 1, p = 2; 1 + p / 2 <= N; i++, p *= 2)
for(j = 1; j + p / 2 <= N; j++)
RMQ[i][j] = min(RMQ[i - 1][j], RMQ[i - 1][j + p / 2]);
p2[0] = 1;
for(i = 1; i < 18; i++)
p2[i] = p2[i - 1] * 2;
log2[1] = 0;
for(i = 2; i <= N; i++)
log2[i] = log2[i / 2] + 1;
}
int query(int lo, int hi) {
int d = (hi - lo + 1);
int step = log2[d];
int p = p2[step];
return min(RMQ[step][lo], RMQ[step][hi - p + 1]);
}
int main() {
int i, x, y;
freopen(inputFile.c_str(), "r", stdin);
freopen(outputFile.c_str(), "w", stdout);
scanf("%d%d", &N, &M);
for(i = 1; i <= N; i++)
scanf("%d", &RMQ[0][i]);
build();
while(M--) {
scanf("%d%d", &x, &y);
printf("%d\n", query(x, y));
}
return 0;
}