UVA - 11235 Frequent values(RMQ)

思路：$left(i)$表示数字i连续出现的右边界，$right(i)$表示数字i连续出现的右边界。由于数的区间是$[-100000, 100000]$，那么我就加了一个数，让每个数都成为非负数。
注意：除了考虑划分成的两段之外，还应该考虑两段的连接处的，因为可能出现连续的却被分成两截的情况。

---

AC代码

#include <stdio.h>
#include <algorithm>
#include <map>
using namespace std;
#define inf 0x3f3f3f3f
const int maxn = 1e5 + 5;
const int W = 1e5; 
int a[maxn], d[maxn][17];
int left[maxn+W], right[maxn+W];

int con(int l, int r, int mid) {
    int num = a[mid];
    l = max(l, left[num]);
    r = min(r, right[num]);
    return r-l+1;
}

void RMQ_init(int n) {
    //初始化 
    for(int i = 0; i < n; i++) {
        d[i][0] = 1;
    }

    for(int j = 1; (1<<j) <= n; j++) {
        for(int i = 0; i + (1<<j) - 1 < n; i++) {
            d[i][j] = max(d[i][j-1], d[i+(1<<(j-1))][j-1]); 
            int l = i, r = i + (1<<j) - 1;
            int mid = l + (1 << (j-1)) - 1;
            d[i][j] = max(con(l, r, mid), d[i][j]);
        }
    }
}

int RMQ(int L, int R) {
    int k = 0, len = R-L+1;
    while((1<<(k+1)) <= len) k++;
    int ans = 0;
    ans = max(d[L][k], d[R-(1<<k)+1][k]);
    int mid = L + (1<<k) - 1;
    ans = max(ans, con(L, R, mid));
    mid = R - (1<<k) + 1;
    return max(ans, con(L, R, mid));
}

int main() {
    int n, q;
    while(scanf("%d", &n) == 1 && n) {
        scanf("%d", &q);
        int pre = inf;
        for(int i = 0; i < n; i++) {
            scanf("%d", &a[i]);
            a[i] += W;
            if(pre != a[i]) {
                if(i-1 >= 0) right[a[i-1]] = i-1;
                left[a[i]] = i;
            }
            pre = a[i];
        }
        right[a[n-1]] = n-1;
        RMQ_init(n);
        for(int i = 0; i < q; i++) {
            int L, R;
            scanf("%d%d", &L, &R);
            printf("%d\n", RMQ(L-1, R-1));
        }
    }
    return 0;
}

如有不当之处欢迎指出!