【SPOJ694&705】Distinct Substrings（后缀数组）

题意：求一个字符串的不相同的子串个数

n<=1000

思路：这是一道论文题

 var a,x,y,sa,rank,height,wc,wd:array[..]of longint;
     n,i,m,ans,v,cas:longint;
     ch:ansistring;

 procedure swap(var x,y:longint);
 var t:longint;
 begin
  t:=x; x:=y; y:=t;
 end;

 function cmp(a,b,l:longint):boolean;
 begin
  exit((y[a]=y[b])and(y[a+l]=y[b+l]));
 end;

 procedure getsa(n:longint);
 var i,j,p:longint;
 begin
  for i:= to n- do
  begin
   x[i]:=a[i];
   inc(wc[a[i]]);
  end;
  for i:= to m- do wc[i]:=wc[i-]+wc[i];
  for i:=n- downto  do
  begin
   dec(wc[x[i]]);
   sa[wc[x[i]]]:=i;
  end;
  j:=; p:=;
  while p<n do
  begin
   p:=;
   for i:=n-j to n- do
   begin
    y[p]:=i; inc(p);
   end;
   for i:= to n- do
    if sa[i]>=j then begin y[p]:=sa[i]-j; inc(p); end;
   for i:= to n- do wd[i]:=x[y[i]];
   for i:= to m- do wc[i]:=;
   for i:= to n- do inc(wc[wd[i]]);
   for i:= to m- do wc[i]:=wc[i-]+wc[i];
   for i:=n- downto  do
   begin
    dec(wc[wd[i]]);
    sa[wc[wd[i]]]:=y[i];
   end;
   for i:= to n do swap(x[i],y[i]);
   p:=; x[sa[]]:=;
   for i:= to n- do
    if cmp(sa[i-],sa[i],j) then x[sa[i]]:=p-
     else begin x[sa[i]]:=p; inc(p); end;
   j:=j*;
   m:=p;
  end;
 end;

 procedure getheight(n:longint);
 var i,j,k:longint;
 begin
  k:=;
  for i:= to n do rank[sa[i]]:=i;
  for i:= to n- do
  begin
   if k> then dec(k);
   j:=sa[rank[i]-];
   while a[i+k]=a[j+k] do inc(k);
   height[rank[i]]:=k;
  end;
 end;

 begin
  assign(input,'spoj694.in'); reset(input);
  assign(output,'spoj694.out'); rewrite(output);
  readln(cas);
  for v:= to cas do
  begin
   fillchar(a,sizeof(a),);
   fillchar(x,sizeof(x),);
   fillchar(y,sizeof(y),);
   fillchar(sa,sizeof(sa),);
   fillchar(rank,sizeof(rank),);
   fillchar(wc,sizeof(wc),);
   fillchar(wd,sizeof(wd),);
   fillchar(height,sizeof(height),);
   readln(ch); n:=length(ch);
   for i:= to n- do a[i]:=ord(ch[i+]);
   a[n]:=; m:=;
   getsa(n+);
   getheight(n);
   ans:=;
   for i:= to n do ans:=ans+n-sa[i]-height[i];
   writeln(ans);
  end;

  close(input);
  close(output);
 end.