Codeforces 666E E - Forensic Examination SA + 莫队 + 线段树

E - Forensic Examination

我也不知道为什么这个复杂度能过， 而且跑得还挺快， 数据比较水？

在sa上二分出上下界， 然后莫队 + 线段树维护区间众数。

#include<bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mk make_pair
#define PLL pair<LL, LL>
#define PLI pair<LL, int>
#define PII pair<int, int>
#define SZ(x) ((int)x.size())
#define ull unsigned long long

using namespace std;

const int N = 6e5 + ;
const int inf = 0x3f3f3f3f;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + ;
const double eps = 1e-;
const double PI = acos(-);

#define F(x) ((x) / 3 + ((x) % 3 == 1 ? 0 : tb))
#define G(x) ((x) < tb ? (x) * 3 + 1 : ((x) - tb) * 3 + 2)

int r[ * N], sa[ * N];
int wa[ * N], wb[ * N], wv[ * N], ss[ * N];
int rnk[N], lcp[N];

int c0(int *r, int a, int b) {return r[a] == r[b] && r[a + ] == r[b + ] && r[a + ] == r[b + ]; }

int c12(int k, int *r, int a, int b) {
    if(k == ) return r[a] < r[b] || r[a] == r[b] && c12(, r, a + , b + );
    return r[a] < r[b] || r[a] == r[b] && wv[a + ] < wv[b + ];
}

void sort(int *r, int *a, int *b, int n, int m) {
    for(int i = ; i < n; i++) wv[i] = r[a[i]];
    for(int i = ; i < m; i++) ss[i] = ;
    for(int i = ; i < n; i++) ss[wv[i]]++;
    for(int i = ; i < m; i++) ss[i] += ss[i - ];
    for(int i = n - ; i >= ; i--) b[--ss[wv[i]]] = a[i];
}

void DC3(int *r, int *sa, int n, int m) {
    int i, j, p;
    int *san = sa + n, *rn = r + n;
    int ta = , tb = (n + ) / , tbc = ;

    r[n] = r[n + ] = ;
    for(i = ; i < n; i++) if(i %  != ) wa[tbc++] = i;

    sort(r + , wa, wb, tbc, m);
    sort(r + , wb, wa, tbc, m);
    sort(r, wa, wb, tbc, m);

    for(p = , rn[F(wb[])] = , i = ; i < tbc; i++)
        rn[F(wb[i])] = c0(r, wb[i - ], wb[i]) ? p -  : p++;

    if(p < tbc) DC3(rn, san, tbc, p);
    else for(i = ; i < tbc; i++) san[rn[i]] = i;

    for(i = ; i < tbc; i++) if(san[i] < tb) wb[ta++] = san[i] * ;
    if(n %  == ) wb[ta++] = n - ;

    sort(r, wb, wa, ta, m);

    for(i = ; i < tbc; i++) wv[wb[i] = G(san[i])] = i;
    for(i = , j = , p = ; i < ta && j < tbc; p++)
        sa[p] = c12(wb[j] % , r, wa[i], wb[j]) ? wa[i++] : wb[j++];

    for( ; i < ta; p++) sa[p] = wa[i++];
    for( ; j < tbc; p++) sa[p] = wb[j++];
}

void calc_LCP(int *r, int *sa, int n) {
    int k = ;
    for(int i = ; i < n; i++) rnk[sa[i]] = i;
    for(int i = ; i < n - ; lcp[rnk[i++]] = k) {
        if(k) k--;
        for(int j = sa[rnk[i] - ]; r[i + k] == r[j + k]; k++);
    }
}

int Log[N];
struct ST {
    int dp[N][], ty;
    void build(int n, int b[], int _ty) {
        ty = _ty;
        for(int i = -(Log[]=-); i < N; i++)
        Log[i] = Log[i - ] + ((i & (i - )) == );
        for(int i = ; i <= n; i++) dp[i][] = ty * b[i];
        for(int j = ; j <= Log[n]; j++)
            for(int i = ; i+(<<j)- <= n; i++)
                dp[i][j] = max(dp[i][j-], dp[i+(<<(j-))][j-]);
    }
    inline int query(int x, int y) {
        int k = Log[y - x + ];
        return ty * max(dp[x][k], dp[y-(<<k)+][k]);
    }
};

namespace SGT {
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
    const int N = 5e4 + ;
    PII a[N << ];
    int b[N];
    void build(int l, int r, int rt) {
        if(l == r) {
            a[rt].se = -l;
            b[l] = rt;
            return;
        }
        int mid = (l + r) >> ;
        build(lson); build(rson);
        a[rt] = max(a[rt << ], a[rt <<  | ]);
    }
    inline void update(int x, int val) {
        x = b[x];
        a[x].fi += val;
        x >>= ;
        for( ; x; x >>= )
            a[x] = max(a[x << ], a[x <<  | ]);
    }
    PII query(int L, int R, int l, int r, int rt) {
        if(R < l || r < L) return mk(-inf, inf);
        if(L <= l && r <= R) return a[rt];
        int mid = (l + r) >> ;
        return max(query(L, R, lson), query(L, R, rson));
    }
}

struct Qus {
    int L, R, numl, numr, id;
    bool operator < (const Qus& rhs) const {
        if(L /  == rhs.L / ) return R < rhs.R;
        return L < rhs.L;
    }
};

int n, m, q, mxc = , who[N];
PII ans[N];
char s[N];
ST rmq;
Qus qus[N];

int main() {
    scanf("%s", s);
    for(int i = ; s[i]; i++)
        r[n++] = s[i], mxc = max(mxc, (int)s[i]);
    scanf("%d", &m);
    for(int i = ; i <= m; i++) {
        r[n++] = mxc++;
        scanf("%s", s);
        for(int j = ; s[j]; j++)
            r[n] = s[j], who[n++] = i;
    }
    r[n] = ;
    DC3(r, sa, n + , mxc);
    calc_LCP(r, sa, n + );
    rmq.build(n, lcp, -);
    scanf("%d", &q);
    for(int i = ; i <= q; i++) {
        int l, r, pl, pr;
        scanf("%d%d%d%d", &l, &r, &pl, &pr);
        int pos = rnk[pl - ], len = pr - pl + ;
        int low = , high = pos - , L = pos, R = pos;
        while(low <= high) {
            int mid = (low + high) >> ;
            if(rmq.query(mid + , pos) >= len) L = mid, high = mid - ;
            else low = mid + ;
        }
        low = pos + , high = n;
        while(low <= high) {
            int mid = (low + high) >> ;
            if(rmq.query(pos + , mid) >= len) R = mid, low = mid + ;
            else high = mid - ;
        }
        qus[i] = Qus{L, R, l, r, i};
    }
    SGT::build(, m, );
    sort(qus + , qus +  + q);
    int l = , r = ;
    for(int i = ; i <= q; i++) {
        int L = qus[i].L, R = qus[i].R, numl = qus[i].numl, numr = qus[i].numr;
        while(r < R) r++, SGT::update(who[sa[r]], );
        while(l > L) l--, SGT::update(who[sa[l]], );
        while(r > R) SGT::update(who[sa[r]], -), r--;
        while(l < L) SGT::update(who[sa[l]], -), l++;
        ans[qus[i].id] = SGT::query(numl, numr, , m, );
    }
    for(int i = ; i <= q; i++) printf("%d %d\n", -ans[i].se, ans[i].fi);
    return ;
}

/*
*/