【BZOJ4650&UOJ219】优秀的拆分（二分，hash）

题意：

思路：

在实现时SA可以用hash+二分代替，会多一个log

BZ上跑的飞快，但UOJ上extra卡出翔，已经放弃

不过转C或者写SA没准就过了

看来转C迫在眉睫

 const mo=;
 var f,g:array[..]of int64;
     h,mi:array[..]of int64;
     v,cas,i,n,j,x,y:longint;
     ans:int64;
     ch:ansistring;

 function min(x,y:longint):longint;
 begin
  if x<y then exit(x);
  exit(y);
 end;

 function hash(x,y:longint):longint;
 begin
  hash:=(h[y]-h[x-]*mi[y-x+] mod mo+mo) mod mo;
 end;

 function lcp(x,y:longint):longint;
 var l,r,mid,last:longint;
 begin
  l:=; r:=min(i,min(n-x+,n-y+)); last:=;
  while l<=r do
  begin
   mid:=(l+r)>>;
   if hash(x,x+mid-)=hash(y,y+mid-) then begin last:=mid; l:=mid+; end
    else r:=mid-;
  end;
  exit(last);
 end;

 function lcs(x,y:longint):longint;
 var l,r,mid,last:longint;
 begin
  l:=; r:=min(i,min(x,y)); last:=;
  while l<=r do
  begin
   mid:=(l+r)>>;
   if hash(x-mid+,x)=hash(y-mid+,y) then begin last:=mid; l:=mid+; end
    else r:=mid-;
  end;
  exit(last);
 end;

 begin

  mi[]:=;
  for i:= to  do mi[i]:=mi[i-]* mod mo;
  readln(cas);
  for v:= to cas do
  begin
   readln(ch);
   n:=length(ch);
   for i:= to n+ do
   begin
    f[i]:=; g[i]:=; h[i]:=;
   end;
   for i:= to n do h[i]:=(h[i-]*+ord(ch[i])-ord('a')+) mod mo;
   for i:= to (n+) div  do
   begin
    j:=;
    while j<=n do
    begin
     if j+i>n then break;
     if (ch[j]<>ch[j+i]) then begin j:=j+i; continue; end;
     x:=lcp(j,j+i); y:=lcs(j,j+i);
    // x:=min(x,i); y:=min(y,i);
     if x+y>i then
     begin
      inc(g[j-y+]); dec(g[j+x-i+]);
      inc(f[j+i-y+i]); dec(f[j+i+x]);
     end;
     j:=j+i;
    end;
   end;
   ans:=;
   for i:= to n do f[i]:=f[i-]+f[i];
   for i:= to n do g[i]:=g[i-]+g[i];
   for i:= to n- do ans:=ans+f[i]*g[i+];
   writeln(ans);
  end;

 end.