POJ 3261 至少重复k次的最长可重叠子串

这个k用二分来找吧

然后可以重叠的话直接在分组里面找就好了

sum置1的话是因为有len这一条串

#include <cstdio>
#include <cstring>
#define maxn 222222
#define ll long long
#define mid ((l+r)>>1)
int s[maxn];
int n,m,sa[maxn],rank[maxn],height[maxn];
int wa[maxn],wb[maxn],ws[maxn],wv[maxn];
int max(int a,int b){return a>b?a:b;}
int min(int a,int b){return a<b?a:b;}
inline bool cmp(int *r,int a,int b,int l)
{
    return (r[a] == r[b]) && (r[a+l] == r[b+l]);
}
inline void da(int n,int m)
{
    int i,j,p,*x=wa,*y=wb,*t;
    memset(ws,0,sizeof(ws));
    for (i=0;i<n;++i)  ws[x[i]=s[i]]++;
    for (i=1;i<m;++i)  ws[i]+=ws[i-1];
    for (i=n-1;i>=0;--i)  sa[--ws[x[i]]]=i;
    for (j=1,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<n;++i)  wv[i]=x[y[i]];
        for (i=0;i<m;++i)  ws[i]=0;
        for (i=0;i<n;++i)  ws[wv[i]]++;
        for (i=1;i<m;++i)  ws[i]+=ws[i-1];
        for (i=n-1;i>=0;--i)  sa[--ws[wv[i]]]=y[i];
        for (t=x,x=y,y=t,p=1,x[sa[0]]=0,i=1;i<n;++i)
            x[sa[i]]=cmp(y,sa[i-1],sa[i],j)?p-1:p++;
    }
}
inline void calcheight()
{
    int i,j,k=0;
    for (i=1;i<=n;++i)  rank[sa[i]]=i;
    for (i=0;i<n;height[rank[i++]]=k)
        for (k?k--:0,j=sa[rank[i]-1];s[i+k]==s[j+k];k++);
}//
int k;
int  judge(int x){
    int sum=1;
    for(int i=2;i<=n;++i){
        if(height[i]<x){sum=1;}
        else{
            sum++;
            if(sum>=k)return 1;
        }
    }
    return 0;
}
void solve(int l,int r){
    int ans=1;
    while(l<=r){
        int x=judge(mid);
        if(x){
            ans=mid;
            l=mid+1;
        }
        else r=mid-1;
    }
    printf("%d\n",ans);
}
int len;
int main(){
    while(~scanf("%d%d",&len,&k)){
        for(int i=0;i<len;++i)scanf("%d",&s[i]);
        s[len]='#';s[len+1]='\0';
        n=len+1;
        da(n+1,255);
        calcheight();
        solve(1,len);
    }
    return 0;
}