POJ 3261 Milk Patterns 【求可重叠至少出现k次的最长重复子串】

模板题，二分长度，然后根据height分组进行验证。

#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e6+100;
const int SIGMA_SIZE = 1e6+100;
int cntA[MAX], cntB[MAX], sa[MAX], tsa[MAX], A[MAX], B[MAX], height[MAX], Rank[MAX];
int n, k,data[MAX];
int bucket[SIGMA_SIZE];

int s[MAX];
void get_SA(const int *ch) {
    for (int i = 0; i < SIGMA_SIZE; i++) bucket[i] = 0;
    for (int i = 1; i <= n; i++) bucket[ch[i - 1]]++;
    for (int i = 1; i < SIGMA_SIZE; i++) bucket[i] += bucket[i - 1];
    for (int i = n; i; i--) sa[bucket[ch[i - 1]]--] = i;
    Rank[sa[1]] = 1;
    for (int i = 2; i <= n; i++) {
        Rank[sa[i]] = Rank[sa[i - 1]];
        if (ch[sa[i] - 1] != ch[sa[i - 1] - 1]) Rank[sa[i]]++;
    }
    for (int l = 1; Rank[sa[n]] < n; l <<= 1) {
        memset(cntA, 0, sizeof(cntA));
        memset(cntB, 0, sizeof(cntB));
        for (int i = 1; i <= n; i++) {
            cntA[A[i] = Rank[i]]++;
            cntB[B[i] = (i + l <= n) ? Rank[i + l] : 0]++;
        }
        for (int i = 1; i <= n; i++) cntB[i] += cntB[i - 1];
        for (int i = n; i; i--) tsa[cntB[B[i]]--] = i;
        for (int i = 1; i <= n; i++) cntA[i] += cntA[i - 1];
        for (int i = n; i; i--) sa[cntA[A[tsa[i]]]--] = tsa[i];
        Rank[sa[1]] = 1;
        for (int i = 2; i <= n; i++) {
            Rank[sa[i]] = Rank[sa[i - 1]];
            if (A[sa[i]] != A[sa[i - 1]] || B[sa[i]] != B[sa[i - 1]]) Rank[sa[i]]++;
        }
    }
    for (int i = 1, j = 0; i <= n; i++) {
        if (j) j--;
        while (ch[i + j - 1] == ch[sa[Rank[i] - 1] + j - 1]) j++;
        height[Rank[i]] = j;
    }
}
bool ok(int mid) {
    int sum = 1;
    for(int i = 2; i <= n; i++) {
        if(height[i]<mid) sum = 1;
        else {
            sum++;
            if(sum>=k) return 1;
        }
    }
    return 0;
}
int main() {
    freopen("a.txt","r",stdin);
    ios::sync_with_stdio(0);
    cin>>n>>k;

    for(int i = 0; i < n; i++) cin>>s[i];
    get_SA(s);
    int l = 0;
    int r = 21000;
    while(l+1<r) {
        int mid = l+r>>1;
        if(ok(mid)) l = mid;
        else r = mid;
    }
    int ans;
    if(ok(r)) ans = r;
    else ans = l;
    cout<<ans;
    return 0;
}