[HDU]3518——Boring counting

zhan.jiang.ou now faced a tough problem,his english teacher quan.hong.chun gives him a string,which consists with n lower case letter,he must figure out how many substrings appear at least twice,moreover,such apearances can not overlap each other.
Take aaaa as an example.”a” apears four times,”aa” apears two times without overlaping.however,aaa can’t apear more than one time without overlaping.since we can get “aaa” from [0-2](The position of string begins with 0) and [1-3]. But the interval [0-2] and [1-3] overlaps each other.So “aaa” can not take into account.Therefore,the answer is 2(“a”,and “aa”).

题目大意：求一个字符串的不重叠子串的个数。

思路：我真是太辣鸡了，其实这个题就是后缀数组性质②的应用，只不过是求出每个长度的答案(性质详见我的后缀数组的基本使用技巧)！

总结：后缀数组英语应用太灵活，多回顾反思！

#include<map>
#include<set>
#include<list>
#include<deque>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<cstdio>
#include<complex>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#define LL long long
#define db double
#define RG register
#define maxx 1001
#define Inf 666666
using namespace std;int tong[maxx];
int sa[maxx],X[maxx],Y[maxx],rnk[maxx],height[maxx],num[maxx];char s[maxx];
bool comp(int *r,int a,int b,int len){
  return r[a]==r[b]&&r[a+len]==r[b+len];
}
void build_sa(int len){
  int *x=X,*y=Y,*t,Max=maxx/2;
  memset(tong,0,sizeof(tong));
  for(int i=0;i<len;++i)
    tong[x[i]=num[i]]++;
  for(int i=1;i<=Max;++i)
    tong[i]+=tong[i-1];
  for(int i=len-1;i!=-1;i--)
    sa[--tong[x[i]]]=i;
  for(int j=1,p=1,i;p<len;j<<=1,Max=p){
    for(i=len-1,p=0;i>=len-j;--i)y[p++]=i;
    for(i=0;i<len;++i)
      if(sa[i]>=j)y[p++]=sa[i]-j;
    for(i=0;i<=Max;++i)
      tong[i]=0;
    for(i=0;i<len;++i)
      tong[x[y[i]]]++;
    for(i=1;i<Max;++i)
      tong[i]+=tong[i-1];
    for(i=len-1;i!=-1;i--)
      sa[--tong[x[y[i]]]]=y[i];
    for(t=x,x=y,y=t,p=1,x[sa[0]]=0,i=1;i<len;++i)
      x[sa[i]]=comp(y,sa[i],sa[i-1],j)?p-1:p++;
  }
}int n;
void geth(){
  int j,k=0;
  for(int i=1;i<=n;++i)
    rnk[sa[i]]=i;
  for(int i=0;i<n;height[rnk[i++]]=k)
    for(k?k--:0,j=sa[rnk[i]-1];num[i+k]==num[j+k];k++);
}
void ans(){LL ans=0;
  for(RG int len=1;len<=(n/2);++len){
    int Max=-Inf,Min=Inf;
      for(RG int i=1;i<=n;++i){
    if(height[i]<len){
      if(Max-Min>=len)ans++;
      Max=-Inf,Min=Inf;
    }
    Max=max(Max,sa[i]);
    Min=min(Min,sa[i]);
    if(i==n&&Max-Min>=len)ans++;
    }
  }
  printf("%lld
",ans);
}
int main(){
  while(scanf("%s",s)){
    n=strlen(s);
    if(n==1&&s[0]=='#')break;
    memset(rnk,0,sizeof(rnk));
    memset(height,0,sizeof(height));
    memset(sa,0,sizeof(sa));
    memset(X,0,sizeof(X));
    memset(Y,0,sizeof(Y));
    for(int i=0;i<n;++i)
      num[i]=s[i]-55;
    num[n]=0;
    build_sa(n+1);
    geth();
    ans();
  }
  return 0;
}