POJ 3693 Maximum repetition substring

给定一个字符串,求重复次数最多的连续重复子串,输出字典序最小的解.
$|S|≤10^5$,只包含小写字母.

Kyle说这题还是有必要做的，于是就做了一下，写了一个妥妥的$O(n\ln n)$被踩了。
过讨论版里的良心数据时输出了奇怪的字符，最后发现是我信赖的后缀数组模板扛不住多case轰炸，rk数组没清空到位。

穷举长度的做法感觉很惊艳。

后缀数组

#include<set>
#include<ctime>
#include<queue>
#include<cstdio>
#include<bitset>
#include<cctype>
#include<bitset>
#include<cstdlib>
#include<cassert>
#include<cstring>
#include<iostream>
#include<algorithm>
#define inf (1<<30)
#define INF (1ll<<62)
#define fi first
#define se second
#define rep(x,s,t) for(register int x=s,t_=t;x<t_;++x)
#define per(x,s,t) for(register int x=t-1,s_=s;x>=s_;--x)
#define prt(x) cout<<#x<<":"<<x<<" "
#define prtn(x) cout<<#x<<":"<<x<<endl
#define pb(x) push_back(x)
#define hash asfmaljkg
#define rank asfjhgskjf
#define y1 asggnja
#define y2 slfvm
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
template<class T>void sc(T &x){
    int f=1;char c;x=0;
    while(c=getchar(),c<48)if(c=='-')f=-1;
    do x=x*10+(c^48);
    while(c=getchar(),c>47);
    x*=f;
}
template<class T>void nt(T x){
    if(!x)return;
    nt(x/10);
    putchar(x%10+'0');
}
template<class T>void pt(T x){
    if(x<0)putchar('-'),x=-x;
    if(!x)putchar('0');
    else nt(x);
}
template<class T>void ptn(T x){
    pt(x);putchar('\n');
}
template<class T>void pts(T x){
    pt(x);putchar(' ');
}
template<class T>inline void Max(T &x,T y){if(x<y)x=y;}
template<class T>inline void Min(T &x,T y){if(x>y)x=y;}

int n;
const int maxs=100005;
const int maxb=17;
char s[maxs];
int stp[maxs];
int mn[maxb][maxs];

struct Suffix{
    static const int maxc=30;
    int n;
    int sa[maxs],rk[maxs];//adc.
    int h[maxs],mn[maxb][maxs];//sup.
    int v[maxs];//sort.
    void sapoly(){
        int *a=rk,*b=h;
        rep(i,1,maxc)v[i]=0;
        rep(i,1,n+1)v[s[i]]++;
        rep(i,1,maxc)v[i]+=v[i-1];
        rep(i,1,n+1)sa[v[s[i]]--]=i;
        rep(i,1,n+1)a[sa[i]]=a[sa[i-1]]+(s[sa[i-1]]!=s[sa[i]]);
        a[n+1]=b[n+1]=0;//important
        for(int p,k=1;k<n;k<<=1){
            p=0;
            rep(i,1,n+1)v[a[sa[i]]]=i;
            rep(i,n-k+1,n+1)b[++p]=i;
            rep(i,1,n+1)if(sa[i]>k)b[++p]=sa[i]-k;
            per(i,1,n+1)sa[v[a[b[i]]]--]=b[i];
            p=0;
            rep(i,1,n+1)b[sa[i]]=(a[sa[i-1]]!=a[sa[i]]||a[sa[i-1]+k]!=a[sa[i]+k])?++p:p;
            swap(a,b);
            if(p==n)break;
        }
        if(a!=rk)memcpy(rk,a,n+1<<2);
    }
    void hipoly(){
        int k=0;
        rep(i,1,n+1){
            for(int j=sa[rk[i]-1];s[j+k]==s[i+k];++k);
            h[rk[i]]=k;if(k)--k;
        }
    }

    void init(int nn){
        n=nn;
        sapoly();
        hipoly();

        rep(i,1,n+1)mn[0][i]=h[i];
        rep(i,1,stp[n]+1)
            rep(j,1,n-(1<<i)+2)
                mn[i][j]=min(mn[i-1][j],mn[i-1][j+(1<<i-1)]);
    }
    void print(){
        rep(i,1,n)pts(rk[i]);ptn(rk[n]);
        rep(i,2,n)pts(h[i]);if(n>1)ptn(h[n]);
    }
    int query(int x,int y){
        x=rk[x],y=rk[y];
        if(x>y)swap(x,y);
        x++;int k=stp[y-x+1];
        return min(mn[k][x],mn[k][y-(1<<k)+1]);
    }
}SA[2];

int atm,ast,alen;
//repeat times
//start position
//length 

int cmp(int a,int b){
    return SA[0].rk[a]<SA[0].rk[b]?a:b;
}

int query(int l,int r){
    int k=stp[r-l+1];
    return cmp(mn[k][l],mn[k][r-(1<<k)+1]);
}

void solve(){
    n=strlen(s+1);

    rep(i,1,n+1)s[i]=s[i]-'a'+1;

    s[0]=s[n+1]=0;
    SA[0].init(n);
    reverse(s+1,s+n+1);

    SA[1].init(n);
    reverse(s+1,s+n+1);

    atm=1;
    ast=SA[0].sa[1];
    alen=1;

    rep(i,1,n+1)mn[0][i]=i;
    rep(i,1,stp[n]+1)
        rep(j,1,n-(1<<i)+2)
            mn[i][j]=cmp(mn[i-1][j],mn[i-1][j+(1<<i-1)]);

    rep(i,1,n){//穷举长度
        for(int j=1;j+i<=n;j+=i){
            int suf=SA[0].query(j,j+i); 
            int pre=min(SA[1].query(n+1-j,n+1-j-i),i);

            int ctm=(suf+pre-1)/i+1;
            if(ctm<atm)continue;

            int lo=max((suf+pre-1)/i*i-suf+1,1);

            int cst=query(j-pre+1,j-lo+1);

            if(ctm>atm){
                atm=ctm;
                ast=cst;
                alen=i;
            }
            else{
                if(ast==cst)continue;//字典序相同取长度较小的 
                ast=cmp(ast,cst);
                if(ast==cst)alen=i;
            }
        }
    }

    alen*=atm;
    rep(i,0,alen)putchar('a'+s[i+ast]-1);
    putchar('\n');  
}

int main(){
//  freopen("pro.in","r",stdin);
//  freopen("chk.out","w",stdout);
    stp[0]=-1;
    rep(i,1,maxs)stp[i]=stp[i>>1]+1;

    int kase=0;
    while(scanf("%s",s+1),s[1]^'#'){
        printf("Case %d: ",++kase);
        solve();
    }
    return 0;
}