432 D. Prefixes and Suffixes

简单的后缀数组.

#include <cstdio>
#include <cstring>
#include <set>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <iostream>
#include <iomanip>
#include <list>
#include <queue>
using namespace std;

typedef long long ll;

const int N = 100000 + 10;
char s[N];
int r[N], tx[N], ty[N], rs[N], ranks[N], sa[N], height[N], rmq[N][20];

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

void suffix(int n, int m)
{
    int i, j, p, *x = tx, *y = ty, *t;
    for(i = 0; i < m; ++i) rs[i] = 0;
    for(i = 0; i < n; ++i) { x[i] = r[i]; ++rs[x[i]];}
    for(i = 1; i < m; ++i) rs[i] += rs[i - 1];
    for(i = n - 1; i >= 0; --i) sa[--rs[x[i]]] = i;
    for(j = p = 1; p < n; j <<= 1, m = p) {
        for(p = 0, i = n - j; i < n; ++i) y[p++] = i;
        for(i = 0; i < n; ++i) { if(sa[i] >= j) y[p++] = sa[i] - j; }
        for(i = 0; i < m; ++i) rs[i] = 0;
        for(i = 0; i < n; ++i) ++rs[x[y[i]]];
        for(i = 1; i < m; ++i) rs[i] += rs[i - 1];
        for(i = n - 1; i >= 0; --i) sa[--rs[x[y[i]]]] = y[i];
        t = x, x = y, y = t;
        for(i = 1, p = 1, x[sa[0]] = 0; i < n; ++i) {
            if(cmp(y, sa[i - 1], sa[i], j)) x[sa[i]] = p - 1;
            else x[sa[i]] = p++;
        }
    }
}

void calheight(int n)
{
    int i, j, k = 0;
    for(i = 1; i <= n; ++i)
        ranks[sa[i]] = i;
    for(i = 0; i < n; ++i) {
        if(k)
            --k;
        j = sa[ranks[i] - 1];
        while(r[i + k] == r[j + k])
            ++k;
        height[ranks[i]] = k;
    }
}

int Log[N];
void initrmq(int n)
{
    int i, k;
    for(i = 2; i <= n; ++i)
        rmq[i][0] = height[i];
    for(k = 1; (1 << k) <= n; ++k) {
        for(i = 2; i + (1 << k) - 1 <= n; ++i) {
            rmq[i][k] = min(rmq[i][k - 1],
                            rmq[i + (1 << (k - 1))][k - 1]);
        }
    }
}

void initlog()
{
    Log[0] = -1;
    for(int i=1;i<N;i++)
        Log[i]=(i&(i-1))?Log[i-1]:Log[i-1] + 1;
}

int lcp(int a, int b ,int n)//求a,b的后缀的公用前缀长度，从0计
{
    if(a==b) return n-a;
    a = ranks[a], b = ranks[b];
    if(a > b)
        swap(a, b);
    ++a;
    int k = (int) Log[b - a + 1] / Log[2];
    return min(rmq[a][k], rmq[b - (1 << k) + 1][k]);
}


int v[N];

int MAIN()
{
    scanf("%s", s);
    int n = (int)strlen(s);
    for (int i = 0; i < n; ++ i) {
        r[i] = s[i] - 'A' + 1;
    }
    r[n] = 0;
    suffix(n + 1, 27);
    calheight(n);
    initlog();
    initrmq(n);
    int pos = ranks[0];
    int min_val = height[pos];
    for (int i = pos; i >= 1; -- i) {
        if (height[i] == 0) {
            break;
        }
        min_val = min(min_val, height[i]);
        v[1] ++;
        v[min_val + 1] --;
    }
    min_val = height[pos + 1];
    for (int i = pos + 1; i <= n; ++ i) {
        if (height[i] == 0) {
            break;
        }
        min_val = min(min_val, height[i]);
        v[1] ++;
        v[min_val + 1] --;
    }
    for (int i = 1; i <= n; ++ i) {
        v[i] = v[i - 1] + v[i];
    }
    vector<pair<int, int> > ans;
    for (int i = 1; i <= n; i ++) {
        int val = lcp(0, n - i, n);
        if (val == i) {
            ans.push_back(make_pair(i, v[i]));
        }
    }
    int size = (int)ans.size();
    cout << size << endl;
    for (int i = 0; i < size; ++ i) {
        cout << ans[i].first << " " << ans[i].second + 1 << endl;
    }
    return 0;
}

int main()
{
    cout << fixed << setprecision(16);
    //ios :: sync_with_stdio(false);
    return MAIN();
}