2018hdu多校7 - AraBellaC

题意：一个字符串，由形如(AAA……BBB……CCC……)的串循环构成，告诉你每个位置上哪些是A，哪些是B，哪些是C，求字典序最小的a,b,c。

思路：枚举循环节，算出每段中$ar_{max}, bl_{min}, br_{max},cl_{min}$.即可

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

const int N = 1e4 + 10;
int T, m, x, a[N], bmi[N], bma[N], c[N];
int mxa[N][16], mib[N][16], mxb[N][16], mic[N][16];

void rmq_init(int *a, int op) {
    for (int i = 0; i <= 10000; i++) {
        if (op == 1) mxa[i][0] = a[i];
        else if (op == 2) mib[i][0] = a[i];
        else if (op == 3) mxb[i][0] = a[i];
        else mic[i][0] = a[i];
    }
    for (int j = 1; (1 << j) <= 10005; j++)
        for (int i = 0; i + (1 << j) - 1 < 10005; i++)
            if (op == 1) mxa[i][j] = max(mxa[i][j - 1], mxa[i + (1 << j - 1)][j - 1]);
            else if (op == 2) mib[i][j] = min(mib[i][j - 1], mib[i + (1 << j - 1)][j - 1]);
            else if (op == 3) mxb[i][j] = max(mxb[i][j - 1], mxb[i + (1 << j - 1)][j - 1]);
            else mic[i][j] = min(mic[i][j - 1], mic[i + (1 << j - 1)][j - 1]);
}

int rmq(int l, int r, int op) {
    int k = 0;
    while (1 << (k + 1) <= r - l + 1) k++;
    if (op == 1) return max(mxa[l][k], mxa[r - (1 << k) + 1][k]);
    else if (op == 2) return min(mib[l][k], mib[r - (1 << k) + 1][k]);
    else if (op == 3) return max(mxb[l][k], mxb[r - (1 << k) + 1][k]);
    else return min(mic[l][k], mic[r - (1 << k) + 1][k]);
}
char op[10];
int main() {
    scanf("%d", &T);
    while (T--) {
        memset(a, 0, sizeof a);
        memset(bmi, 0x3f, sizeof bmi);
        memset(bma, 0, sizeof bma);
        memset(c, 0x3f, sizeof c);
        int ansa, ansb, ansc;
        ansa = ansb = ansc = N;
        scanf("%d", &m);
        for (int i = 0; i < m; i++) {
            scanf("%d%s", &x, op);
            if (op[0] == 'A') a[x] = x;
            else if (op[0] == 'B') bmi[x] = bma[x] = x;
            else c[x] = x;
        }
        rmq_init(a, 1);
        rmq_init(bmi, 2);
        rmq_init(bma, 3);
        rmq_init(c, 4);

        for (int i = 3; i <= 9998; i++) {
            int ar = 1, bl = N, br = 1, cl = N;
            for (int j = 1; j < 10000; j += i) {
                ar = max(ar, rmq(j, min(j + i - 1, 10000), 1) - j + 1);
                bl = min(bl, rmq(j, min(j + i - 1, 10000), 2) - j + 1);
                br = max(br, rmq(j, min(j + i - 1, 10000), 3) - j + 1);
                cl = min(cl, rmq(j, min(j + i - 1, 10000), 4) - j + 1);
            }
            int ta = ar, tb = br - ar, tc = i - br;
            if (ar < bl && br < cl && ar + 1 < cl) {
                if (ta < ansa && ta && tb && tc > 0) {
                    ansa = ta;
                    ansb = tb;
                    ansc = tc;
                }
                else if (ta == ansa && tb < ansb && ta && tb && tc > 0) {
                    ansa = ta;
                    ansb = tb;
                    ansc = tc;
                }
                else if (ta == ansa && tb == ansb && i - ta - tb < ansc && ta && tb && tc > 0) {
                    ansa = ta;
                    ansb = tb;
                    ansc = tc;
                }
            }
        }
        if (ansa < N && ansb < N && ansc < N) printf("%d %d %d\n", ansa, ansb, ansc);
        else puts("NO");
    }
}