Cod sursa(job #1360388)

Utilizator mirceadinoMircea Popoveniuc mirceadino Data 25 februarie 2015 14:14:43
Problema Range minimum query Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.19 kb
#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[NMAX][18];
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[j][i] = min(RMQ[j][i - 1], RMQ[j + p / 2][i - 1]);

    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[lo][step], RMQ[hi - p + 1][step]);
}

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[i][0]);

    build();

    while(M--) {
        scanf("%d%d", &x, &y);
        printf("%d\n", query(x, y));
    }

    return 0;
}