Uva 11235 Frequent Values (RMQ ST)

代码总览

#include <bits/stdc++.h>
#define rep(i,a,b) for (int i = a; i<=b; ++i)
using namespace std;
const int nmax = 1e5 + 10;
const int INF = 0x3f3f3f3f;
typedef long long ll;
typedef double db;
int num[nmax], shift[nmax];
int a[nmax], dp[nmax][20];
int n, m;
void getdp() {
    rep(i, 0, n - 1) dp[i][0] = a[i];
    for (int j = 1; (1 << j) <= n; ++j) {
        for (int i = 0; i + (1 << j) - 1 < n; ++i) {
            dp[i][j] = max(dp[i][j - 1], dp[i + (1 << (j - 1) )][j - 1]);
        }
    }
}
int RMQ(int l , int r) {
    if (l > r) return 0;
    int k = 0;
    while (1 << (k + 1) <= r - l + 1) k++;
    return max(dp[l][k], dp[r - (1 << k) + 1][k]);
}
int main() {
    // printf("%.f\n", log2(1e5));
    while (scanf("%d", &n)  && n != 0) {
        scanf("%d", &m);
        memset(num, 0, sizeof num);
        memset(dp, 0, sizeof dp);
        memset(a, 0, sizeof a);
        memset(shift, 0, sizeof shift);
        rep(i, 0, n - 1) scanf("%d", &num[i]);
        int l, r, now = num[0], len = 1; a[0] = 1;
        rep(i, 1, n - 1) {
            if (now == num[i]) {
                len ++;
                a[i] = len;
            } else {
                now = num[i];
                len = 1;
                a[i] = len;
            }
        }
        getdp();
        now = -1;
        for (int i = n - 1; i >= 0; --i) {
            if (now == -1 && a[i] != 1) shift[i] = now;
            else if (now == -1 && a[i] == 1) shift[i] = 0, now = i;
            else if (now != -1 && a[i] == 1) shift[i] = 0, now = i;
            else if (now != -1 && a[i] != 1) shift[i] = now;
        }
        rep(i, 1, m) {
            scanf("%d %d", &l, &r);
            l--, r--;
            if (shift[l] == -1) {
                printf("%d\n", a[r] - a[l] + 1);
            } else if (shift[l] == 0) {
                printf("%d\n", RMQ(l, r));
            } else {
                int temp = RMQ(shift[l], r);
                int temp2 = a[min(shift[l] - 1, r)] - a[l] + 1;
                printf("%d\n", max(temp, temp2));
            }
        }
    }

    return 0;
}