LightOJ - 1082 Array Queries(RMQ)

题目大意：给你N个数字，Q个询问，询问的是一个区间的最小值

解题思路：RMQ裸题

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 100010;
int val[N];
int dp[N][64];
int n, q, cas = 1;

void init() {
    scanf("%d%d", &n, &q);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &val[i]);
        dp[i][0] = val[i];
    }

    for (int j = 1; (1 << j) <= n; j++)
        for (int i = 1; i + (1 << j) - 1 <= n; i++)
            dp[i][j] = min(dp[i][j - 1], dp[i + (1 << (j - 1))][j - 1]);
}

int Query(int l, int r) {
    int k = 0;
    while (l + (1 << (k + 1)) - 1 <= r) k++;
    return min(dp[l][k], dp[r - (1 << k) + 1][k]);
}

void solve() {
    printf("Case %d:\n", cas++);
    int l, r;
    while (q--) {
        scanf("%d%d", &l, &r);
        printf("%d\n", Query(l, r));
    }
}
int main() {
    int test;
    scanf("%d", &test);
    while (test--) {
        init();
        solve();
    }
    return 0;
}