spoj Repeats

题目链接

分析：这是一道sa的经典题目，求一个长串中连续重复出现的的串的最大次数。
首先将sa和height数组求出来。
这样思考：如果一个串连续出现了k次，设这个串长度为len，如果在第i位出现了串中的某个字符，那么i + len, i + 2*len……都会出现这个字符。

那么先枚举串的长度len，对于每个i + k * len位，应该都能够有最长公共子串lcp>=len，串重复的次数为Len / len + 1，Len为最长公共子串的长度。因为Len不一定整除len，代表着可能会有一些串余下不能构成一个新的串。这时候可以尝试把i向前移len - Len % len 位，使得后面能够补齐。如果这样计算出来的lcp比之前算出来的大，那么意味着补齐之后又能够形成一个重复子串。答案在原基础上加上一。枚举串长后找最大值为答案。
复杂度$O(NlogN)$N为串的长度。

代码：

/*****************************************************/
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <map>
#include <set>
#include <ctime>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <iostream>
#include <algorithm>

using namespace std;

#define   offcin        ios::sync_with_stdio(false)
#define   sigma_size    26
#define   lson          l,m,v<<1
#define   rson          m+1,r,v<<1|1
#define   slch          v<<1
#define   srch          v<<1|1
#define   sgetmid       int m = (l+r)>>1
#define   ll            long long
#define   ull           unsigned long long
#define   lowbit(x)     (x&-x)
#define   bits(a)       __builtin_popcount(a)

const int    INF    = 0x3f3f3f3f;
const ll     INFF   = 1e18;
const double pi     = acos(-1.0);
const double inf    = 1e18;
const double eps    = 1e-9;
const ll     mod    = 1e9+7;
const int    maxmat = 10;
const ull    BASE   = 133333331;

/*****************************************************/
inline void RI(int &x) {
      char c;
      while((c=getchar())<'0' || c>'9');
      x=c-'0';
      while((c=getchar())>='0' && c<='9') x=(x<<3)+(x<<1)+c-'0';
}
/*****************************************************/

const int maxn = 5e4 + 5;

char tmp[5];
int s[maxn];
int rank_sa[maxn], height[maxn];
int sa[maxn], t[maxn], t2[maxn], c[maxn];
int mheight[maxn][17];

// 以字符值数组s构造sa，字符值从0-m-1
// 调用的额时候注意：需要在s数组最后加上0，作为最小的字符，sa[0], height[0], height[1]都无意义
// build_sa(字符串长度 + 1) // 需要加上最后的空字符
// 其他均需要加一

void build_sa(int n, int m) {
    int *x = t, *y = t2;
    for (int i = 0; i < m; i ++) c[i] = 0;                
    for (int i = 0; i < n; i ++) c[x[i] = s[i]] ++;
    for (int i = 1; i < m; i ++) c[i] += c[i - 1];          
    for (int i = n - 1; i >= 0; i --) sa[-- c[x[i]]] = i;
    for (int k = 1; k < n; k <<= 1) {
        int p = 0;              
        for (int i = n - k; i < n; i ++) y[p ++] = i;
        for (int i = 0; i < n; i ++) if (sa[i] >= k) y[p ++] = sa[i] - k;
        for (int i = 0; i < m; i ++) c[i] = 0; 
        for (int i = 0; i < n; i ++) c[x[y[i]]] ++;
        for (int i = 1; i < m; i ++) c[i] += c[i - 1];
        for (int i = n - 1; i >= 0; i --) sa[-- c[x[y[i]]]] = y[i];
        swap(x, y);                              
        p = 1; x[sa[0]] = 0;
        for (int i = 1; i < n; i ++)
            x[sa[i]] = (y[sa[i - 1]] == y[sa[i]] 
                && y[sa[i - 1] + k] == y[sa[i] + k]) ? p - 1 : p ++;
        if (p >= n) break;
        m = p;
    }
}

void getHeight(int n) {
    int k = 0;
    height[0] =  0;  
    for (int i = 0; i < n; i ++) rank_sa[sa[i]] = i;
    for(int i = 0; i < n - 1; i ++) {  
        int j = sa[rank_sa[i] - 1];  
        while(i + k < n && j + k < n && s[i + k] == s[j + k]) k++;
        height[rank_sa[i]] = k;
        k = max(0, k - 1);  
    }  
}

void init_rmq(int n) {
    for (int i = 0; i < n; i ++) mheight[i][0] = height[i];
    for (int j = 1; (1 << j) < n; j ++) {
        for (int i = 1; i <= n; i ++) {
            if (i + (1 << (j)) > n) break;
            mheight[i][j] = min(mheight[i][j - 1], mheight[i + (1 << (j - 1))][j - 1]);
        }
    }
}

int query(int l, int r) {
    l = rank_sa[l], r = rank_sa[r];
    if (l > r) swap(l, r); l ++;
    int k = 31 - __builtin_clz(r - l + 1);
    return min(mheight[l][k], mheight[r - (1 << k) + 1][k]);
}

void solve(int n) {
    int ans = 0;
    for (int len = 1; len <= n; len ++) {
        for (int i = 0; i + len < n; i += len) {
            int tlen = query(i, i + len);
            int tmp = tlen / len + 1;
            int pre = i - (len - tlen % len);
            if (pre >= 0 && query(pre, pre + len) / len + 1 > tmp) tmp ++;
            ans = max(ans, tmp);
        }
    }
    printf("%d\n", ans);
}

void Debug(int n) {
    for (int i = 0; i < n; i ++)
        cout<<height[i]<<" ";
    cout<<endl;
    for (int i = 0; i < n; i ++)
        cout<<sa[i]<<" ";
    cout<<endl;
}

int main(int argc, char const *argv[]) {
    // freopen("in.txt", "r", stdin);
    // freopen("b.txt", "w", stdout);
    int T; cin>>T;
    while (T --) {
        int N; cin>>N;
        for (int i = 0; i < N; i ++) {
            scanf("%s", tmp);
            s[i] = tmp[0] - 'a' + 1;
        }
        s[N] = 0;

        build_sa(N + 1, 5);
        getHeight(N + 1);
        init_rmq(N + 1);

        // Debug(N + 1);

        solve(N + 1);
    }
    return 0;
}