BZOJ4556: [Tjoi2016&Heoi2016]字符串

这道题说难也不难，但是有一个很经典的维护主席树的思想。首先我们先建出一个后缀数组，然后我们按照sa的顺序建一棵以原串下表为权值的主席树，查询$(a, b, c, d)$的时候，先二分一个长度，找出sa中串$[c, c+len]$的区间，然后查询区间中是否有下标属于$[a, b-len+1]$。
代码：

#include <cstdio>
#include <algorithm>
using namespace std;
#define MAXN 100005
#define rep(i, s, t) for(i = s; i < t; ++ i)
#define per(i, s, t) for(i = s-1; i>=t;-- i)
int n, m, sa[MAXN], ac[MAXN], ak[MAXN];
int ht[MAXN], rk[MAXN], c[MAXN], lg[MAXN];
char s[MAXN]; int mn[18][MAXN], rt[MAXN];
inline bool cmp(int *y, int i, int j, int l) {
    return y[i] == y[j] && y[i + l] == y[j + l];
}
void da(int n, int m) {
    int i, j, p = 0, *x = ac, *y = ak, *t;
    rep(i, 0, n) c[x[i] = s[i]] ++;
    rep(i, 1, m) c[i] += c[i-1];
    per(i, n, 0) sa[-- c[x[i]]] = i;
    for(j = 1; p < n; j <<= 1, m = p) {
        p = 0;
        rep(i, n-j, n) y[p ++] = i;
        rep(i, 0, n) if(sa[i] >= j) y[p ++] = sa[i] - j;
        rep(i, 0, m) c[i] = 0;
        rep(i, 0, n) ++ c[x[i]];
        rep(i, 1, m) c[i] += c[i-1];
        per(i, n, 0) sa[-- c[x[y[i]]]] = y[i];
        for(t = x, x = y, y = t, p = 1, x[sa[0]] = 0, i = 1; i < n; ++ i)
            x[sa[i]] = cmp(y, sa[i], sa[i-1], j) ? p-1 : p ++;
    }
}
void Ht(int n) {
    int i, j, k = 0;
    for(i = 1; i <= n; ++ i) rk[sa[i]] = i;
    for(i = 0; i < n; ht[rk[i ++]] = k) {
        if(k) k --; j = sa[rk[i]-1];
        for(; s[i+k] == s[j+k]; ++ k);
    }
}
void St() {
    int i, j;
    rep(i, 1, n+1) mn[0][i] = ht[i];
    rep(j, 1, 18) for(i = n-(1<<j)+1; i > 0; -- i)
        mn[j][i] = min(mn[j-1][i], mn[j-1][i+(1<<j-1)]);
}
#define MID ((l+r)>>1)
struct { int l, r, c; } t[MAXN * 20];
int tot;
int ins(int p, int l, int r, int v) {
    int rt = ++ tot;
    t[rt] = t[p]; ++ t[rt].c;
    if(l == r) return rt;
    if(v <= MID) t[rt].l = ins(t[p].l, l, MID, v);
    else t[rt].r = ins(t[p].r, MID+1, r, v);
    return rt;
}
int qry(int r1, int r2, int l, int r, int L, int R) {
    if(L <= l && r <= R) return t[r2].c - t[r1].c;
    int ans = 0;
    if(L <= MID) ans = qry(t[r1].l, t[r2].l, l, MID, L, R);
    if(R > MID) ans+=qry(t[r1].r, t[r2].r, MID+1, r, L, R);
    return ans;
}
inline void R(int&n) {
    char c;n=0;do c=getchar();while('0'>c||c>'9');
    while('0'<=c&&c<='9')n=n*10+c-'0',c=getchar();
}
int main() {
    scanf("%d%d", &n, &m);
    scanf("%s", s);
    for(int i = 2; i <= n; ++ i) lg[i] = lg[i>>1] + 1;
    da(n + 1, 200); Ht(n); St();
    for(int i = 1; i <= n; ++ i)
        rt[i] = ins(rt[i-1], 1, n, sa[i]+1);
    int a, b, c, d;
    for(int i = 1; i <= m; ++ i) {
        R(a); R(b); R(c); R(d);
        int l = 1, r = min(d-c+1, b-a+1), mid, ans = 0;
        while(l <= r) {
            mid = l + r >> 1;
            int lp = rk[c-1], rp = lp;
            for(int k = lg[n]; k >= 0; -- k) {
                if(lp>=(1<<k)&&mn[k][lp-(1<<k)+1]>=mid) lp -= 1<<k;
                if(rp<=n-(1<<k) && mn[k][rp+1] >= mid) rp += 1<<k;
            }
            if(qry(rt[lp-1], rt[rp], 1, n, a, b-mid+1) > 0) ans = mid, l = mid+1;
            else r = mid-1;
        }
        printf("%d\n", ans);
    }
    return 0;
}