后缀数组

#include<iostream>
#include<string>
using namespace std;
const int maxn = 1048576+10;
const int maxm = 127;
string s;
int sa[maxn], rak[maxn], heigh[maxn], vis[maxm], second[maxn], n, N;
void get_sa() {
    //这里r代表等级，相同权值是一个名次，1 2 2 3 3 3 4...
    int m = maxm, *se = second, *r = rak;
    for (int i = 0; i < m; ++i) vis[i] = 0;
    for (int i = 0; i < n; ++i) ++vis[r[i] = s[i]];
    for (int i = 1; i < m; ++i) vis[i] += vis[i - 1];
    for (int i = n - 1; i >= 0; --i) sa[--vis[r[i]]] = i;//sa[i]=k:排i的是k号
    for (int k = 1; k < n; k<<=1) {
        int p = 0;
        //由sa数组排序第二关键字
        for (int i = n - k; i < n; ++i) se[p++] = i;
        for (int i = 0; i < n; ++i) { if (sa[i] >= k) se[p++] = sa[i] - k; }
        //第一关键字排序求得新的sa
        for (int i = 0; i < m; ++i) vis[i] = 0;
        for (int i = 0; i < n; ++i) ++vis[r[se[i]]];
        for (int i = 1; i < m; ++i) vis[i] += vis[i - 1];
        for (int i = n - 1; i >= 0; --i) sa[--vis[r[se[i]]]] = se[i];
        //se暂存上一轮的r、由此求得新的r
        swap(se, r);
        p = 0, r[sa[0]] = p;
        for (int i = 1; i < n; ++i)
            r[sa[i]] = (se[sa[i - 1]] == se[sa[i]] && se[sa[i - 1] + k] == se[sa[i] + k]) ? p : ++p;

        if (p == n - 1) break;
        m = p + 1;
    }
}
void get_h() {
    //这里r代表排名，相同权值是一个名次，1 2 3 4 5...
    int k = 0, j;
    for (int i = 0; i < n; ++i) rak[sa[i]] = i;
    for (int i = 0; i < n; ++i) {
        k = k ? k - 1 : 0;
        j = sa[rak[i] - 1];
        while (s[i + k] == s[j + k]) ++k;
        heigh[rak[i]] = k;
    }
}
int main() {
    cin >> N; getchar();
    getline(cin, s);
    s += (char)0; n = s.size();
    get_sa();
    get_h();
}