spoj687 REPEATS

http://www.elijahqi.win/2018/02/23/spoj687-repeats/
题意翻译

给定字符串，求重复次数最多的连续重复子串

题目描述

A string s is called an (k,l)-repeat if s is obtained by concatenating k>=1 times some seed string t with length l>=1. For example, the string

s = abaabaabaaba

is a (4,3)-repeat with t = aba as its seed string. That is, the seed string t is 3 characters long, and the whole string s is obtained by repeating t 4 times.

Write a program for the following task: Your program is given a long string u consisting of characters ‘a’ and/or ‘b’ as input. Your program must find some (k,l)-repeat that occurs as substring within u with k as large as possible. For example, the input string

u = babbabaabaabaabab

contains the underlined (4,3)-repeat s starting at position 5. Since u contains no other contiguous substring with more than 4 repeats, your program must output the maximum k.

输入输出格式

输入格式：

In the first line of the input contains H- the number of test cases (H <= 20). H test cases follow. First line of each test cases is n - length of the input string (n <= 50000), The next n lines contain the input string, one character (either ‘a’ or ‘b’) per line, in order.

输出格式：

For each test cases, you should write exactly one interger k in a line - the repeat count that is maximized.

输入输出样例

输入样例#1： 复制

1
17
b
a
b
b
a
b
a
a
b
a
a
b
a
a
b
a
b
输出样例#1： 复制

4
枚举循环节长度 类似有一个kmp求循环节的那题 我可以针对枚举的这个后缀求一下lcp 用lcp/循环节就是我循环了几次 往后匹配我们只要看两个后缀的LCP即可，而往前匹配，一个显然的做法是把串反过来，接到后面看对应的后缀的LCP。实际上并不需要这样，我们只需要看它还差几个字符就可以是循环次数加1，那我们就往前移这么多位，看这两个后缀的LCP长度是否足够，足够就加1（最多也只会加1,因为如果加2，那么这个答案就会被上一次枚举统计过了。）

#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 55000
using namespace std;
int cnt[N],rk[N<<1],rk1[N<<1],tmp[N],sa[N],height[N],st[N][20],bin[20],ans,n,m,k,T,Log[N];
char s[N],c[2];
inline int lcp(int l,int r){
    l=rk[l],r=rk[r];if (l>r) swap(l,r);++l;
    int t=Log[r-l+1];return min(st[l][t],st[r-bin[t]+1][t]);
}
int main(){
    freopen("spoj687.in","r",stdin);
    scanf("%d",&T);for (int i=0;i<=20;++i) bin[i]=1<<i;
    Log[0]=-1;for (int i=1;i<=50000;++i) Log[i]=Log[i>>1]+1;
    while(T--){
        scanf("%d",&n);m=255;memset(rk,0,sizeof(rk));memset(rk1,0,sizeof(rk1));
        for(int i=1;i<=n;++i) scanf("%s",c),s[i]=c[0];
        for (int i=1;i<=m;++i) cnt[i]=0;ans=0;
        for (int i=1;i<=n;++i) cnt[s[i]]=1;
        for (int i=1;i<=m;++i) cnt[i]+=cnt[i-1];
        for (int i=1;i<=n;++i) rk[i]=cnt[s[i]];
        for (int p=1;k!=n;p<<=1,m=k){
            for (int i=1;i<=m;++i) cnt[i]=0;
            for (int i=1;i<=n;++i) ++cnt[rk[i+p]];
            for (int i=1;i<=m;++i) cnt[i]+=cnt[i-1];
            for (int i=n;i;--i) tmp[cnt[rk[i+p]]--]=i;
            for (int i=1;i<=m;++i) cnt[i]=0;
            for (int i=1;i<=n;++i) ++cnt[rk[i]];
            for (int i=1;i<=m;++i) cnt[i]+=cnt[i-1];
            for (int i=n;i;--i) sa[cnt[rk[tmp[i]]]--]=tmp[i];
            memcpy(rk1,rk,sizeof(rk)>>1);rk[sa[1]]=k=1;
            for (int i=2;i<=n;++i){
                if(rk1[sa[i]]!=rk1[sa[i-1]]||rk1[sa[i]+p]!=rk1[sa[i-1]+p]) ++k;
                rk[sa[i]]=k;
            }
        }k=0;
        for (int i=1;i<=n;++i){
            if (rk[i]==1) continue;
            k=k==0?0:k-1;
            while(s[i+k]==s[sa[rk[i]-1]+k]) ++k;
            height[rk[i]]=k;
        }//for (int i=1;i<=n;++i) printf("%d ",height[i]);puts("");
        for (int i=1;i<=n;++i) st[i][0]=height[i];
        for (int j=1;bin[j]<=n;++j)
            for (int i=1;i+bin[j]-1<=n;++i)
                st[i][j]=min(st[i][j-1],st[i+bin[j-1]][j-1]);
        for (int p=1;p<=n;++p){
            for (int i=1;i<=n;i+=p){
                int tmp=lcp(i,i+p),k=i-(p-tmp%p);tmp/=p;
                if (k>=1&&lcp(k,k+p)>=p)++tmp;ans=max(ans,tmp+1);
            }
        }printf("%d\n",ans);
    }
    return 0;
}