RMQ求区间最值与其对应下标

注意：数组下标从1开始。

int dp[1000001][40];
int pos[1000001][40];

void ST(int n) {
    fill(dp[0], dp[0] + 1000001 * 20 + 1, 1111111);
    for (int i = 1; i <= n; i++) {
        dp[i][0] = a[i];
        pos[i][0] = i;
    }
    for (int j = 1; (1 << j) <= n; j++) {
        for (int i = 1; i + (1 << j) - 1 <= n; i++) {
            if (dp[i][j - 1] > dp[i + (1 << (j - 1))][j - 1]) {
                dp[i][j] = dp[i + (1 << (j - 1))][j - 1];
                pos[i][j] = pos[i + (1 << (j - 1))][j - 1];
            } else {
                dp[i][j] = dp[i][j - 1];
                pos[i][j] = pos[i][j - 1];
            }
        }
    }
}

int RMQ(int l, int r) {
    int k = 0;
    while ((1 << (k + 1)) <= r - l + 1)
        k++;
    if (dp[l][k] < dp[r - (1 << k) + 1][k]) {
        p = pos[l][k];
        return dp[l][k];
    } else {
        p = pos[r - (1 << k) + 1][k];
        return dp[r - (1 << k) + 1][k];
    }
}