【RMQ-ST算法】hihocoder1068

最新推荐文章于 2018-11-04 18:57:00 发布

bit_line

最新推荐文章于 2018-11-04 18:57:00 发布

阅读量659

点赞数

分类专栏：动态规划

本文链接：https://blog.csdn.net/bit_Line/article/details/48738555

版权

动态规划专栏收录该内容

13 篇文章 0 订阅

订阅专栏

$dp[i][j]$ 表示区间 $[i, i + 2^j)$ 的最小值
$dp[i][j]=min(dp[i][j-1], dp[i + 2^{j-1}][j-1]$
对于询问 $[le,ri]$ ，令 $len=ri-le+1$ ，再令 $2^{lb}\le len \lt 2^{lb+1}$ ，则 $m i n [l e, r i] = m i n {d p [l e] [l b], d p [r i - 2 l b + 1] [l b]}$ ${min}_{[le,ri]}=min\{dp[le][lb], dp[ri-2^{lb}+1][lb]\}$

/* **********************************************

    File Name: 1068.cpp

    Auther: zhengdongjian@tju.edu.cn

    Created Time: 2015/9/25 星期五 下午 9:19:08

*********************************************** */
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;

const int MAX = 1000007;
const int MAX_L = 21;
int dp[MAX][MAX_L];
int a[MAX];
int po[MAX_L];

int main() {
    po[0] = 1;
    for (int i = 1; i < MAX_L; ++i) {
        po[i] = po[i - 1] << 1;
    }

    int n;
    scanf(" %d", &n);
    for (int i = 1; i <= n; ++i) {
        scanf(" %d", a + i);
    }
    for (int i = n; i >= 1; --i) {
        dp[i][0] = a[i];
        for (int j = 1; i + (1 << j) <= n + 1; ++j) {
            //[i, i + (1 << j))
            //[i, i + (1 << (j - 1))) | [i + (1 << (j - 1)), i + (1 << j))
            //=>
            //dp[i][j - 1] | dp[i + (1 << (j - 1))][j - 1]
            dp[i][j] = min(dp[i][j - 1], dp[i + (1 << (j - 1))][j - 1]);
            //printf("dp[%d][%d] = %d\n", i, j, dp[i][j]);
        }
    }

    int m;
    scanf(" %d", &m);
    while (m--) {
        int le, ri;
        scanf(" %d %d", &le, &ri);
        int lb = upper_bound(po, po + MAX_L, ri - le + 1) - po - 1;
        //printf("lb = %d\n", lb);
        //printf("cut to dp[%d][%d] and dp[%d][%d]\n", le, lb, ri - po[lb] + 1, lb);
        printf("%d\n", min(dp[le][lb], dp[ri - po[lb] + 1][lb]));
    }
    return 0;
}