hdu 3518 重复两次以上的不相交子串

枚举到len／2就可以了 1000的范围真的太小了  所以枚举到len也没什么关系 ⚠注意妥善存储读进来的串就可以了

#include <cstdio>
#include <cstring>
#define maxn 11111
#define ll long long
char 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++);
}//
#define inf 99999999
char s1[maxn];
int main(){
    while(~scanf("%s",s),s[0]!='#'){
        int len=(int)strlen(s);
        s[len]='#';s[len+1]='\0';
        n=len;
        da(n+1,255);
        calcheight();
        ll ans=0;
//        for(int i=1;i<=n;++i)printf("%d ",sa[i]);printf("\n");
//        for(int i=2;i<=n;++i)printf("%d ",height[i]);printf("\n");
        
        for(int i=1;i<=len;++i){
            int l=inf,r=-inf;
            
             for(int j=2;j<=n;++j){
                 if(i<=height[j]){
                     l=min(l,min(sa[j],sa[j-1]));
                     r=max(r,max(sa[j],sa[j-1]));
                 }
                 else{
                     if(r-l>=i)ans++;
                     l=inf,r=-inf;
                 }
            }
            if(r-l>=i)ans++;
        }
        
        printf("%lld\n",ans);
    }
    return 0;
}