【POJ3693】Maximum repetition substring (SA)

这是一道神奇的题目..论文里面说得不清楚，其实是这样...如果一个长度为l的串重复多次，那么至少s[1],s[l+1],s[2*l+1],..之中有相邻2个相等...设这时为j=i*l+1,k=j+l,我们这时候借助SA和RMQ  O(1)求出：m=lcp(j,k),这时候，重复次数至少ans=m div l+1 。  当然，我们枚举到不一定能够是最优啊，因为你枚举的不一定是字符串的首尾..那这时候怎么办？就是论文里面说的，向前和向后匹配。我们设t=l-m mod l..可以理解为，这时候 m mod l为多出来的字符，t就看成是前面少的字符个数..当然如果m mod l=0就不用管这个了...那也就是说，我们再判断是否lcp(j-t,k-t)>=l   如果成立，那么 ans++ ...因为可以多出一段..

上面就解决了求最长的问题，下面将关于字典序的这个...其实SA就是字典序了，只要枚举是否 lcp(sa[i],sa[i]+l)>=(ans-1)*l，若成立，显然当前sa[i]起始长度为l的字符串就是答案...

嗯..写完顿时觉得涨姿势了..

const maxn=;
var
 rec,c,h,rank,sa,x,y:array[..maxn] of longint;
 f:array[..maxn,..] of longint;
 n,cas:longint;
 s:ansistring;

function max(x,y:longint):longint; begin if x>y then exit(x) else exit(y); end;
function min(x,y:longint):longint; begin if x<y then exit(x) else exit(y); end;
procedure swap(var x,y:longint); var tmp:longint; begin tmp:=x;x:=y;y:=tmp; end;

procedure make;
var p,i,tot:longint;
begin
 p:=;
 while p<n do
  begin
   fillchar(c,sizeof(c),);
   for i:=  to n-p do y[i]:=rank[i+p];
   for i:= n-p+ to n do y[i]:=;
   for i:=  to n do inc(c[y[i]]);
   for i:=  to n do inc(c[i],c[i-]);
   for i:=  to n do
    begin
     sa[c[y[i]]]:=i;
     dec(c[y[i]]);
    end;
   fillchar(c,sizeof(c),);
   for i:=  to n do x[i]:=rank[i];
   for i:=  to n do inc(c[x[i]]);
   for i:=  to n do inc(c[i],c[i-]);
   for i:= n downto  do
    begin
     y[sa[i]]:=c[x[sa[i]]];
     dec(c[x[sa[i]]]);
    end;
   for i:=  to n do sa[y[i]]:=i;
   tot:=;
   rank[sa[]]:=;
   for i:=  to n do
    begin
     if (x[sa[i]]<>x[sa[i-]]) or (x[sa[i]+p]<>x[sa[i-]+p]) then inc(tot);
     rank[sa[i]]:=tot;
    end;
   p:=p<<;
  end;
 for i:=  to n do sa[rank[i]]:=i;
end;

procedure makeh;
var i,j,p:longint;
begin
 h[]:=; p:=;
 for i:=  to n do
  begin
   p:=max(p-,);
   if rank[i]= then continue;
   j:=sa[rank[i]-];
   while (i+p<=n) and (j+p<=n) and (s[i+p]=s[j+p]) do inc(p);
   h[rank[i]]:=p;
  end;
end;

procedure rmq;
var i,j:longint;
begin
 for i:=  to n do f[i,]:=h[i];
 for i:=  to trunc(ln(n)/ln()) do
  for j:=  to n-<<i+ do
   f[j,i]:=min(f[j,i-],f[j+<<(i-),i-]);
end;

procedure init;
var i,tot:longint;
begin
 n:=length(s);
 for i:=  to n do x[i]:=ord(s[i]);
 fillchar(c,sizeof(c),);
 for i:=  to n do inc(c[x[i]]);
 for i:=  to  do inc(c[i],c[i-]);
 for i:=  to n do
  begin
   sa[c[x[i]]]:=i;
   dec(c[x[i]]);
  end;
 rank[sa[]]:=;
 tot:=;
 for i:=  to n do
  begin
   if x[sa[i]]<>x[sa[i-]] then inc(tot);
   rank[sa[i]]:=tot;
  end;
 make;
 makeh;
 rmq;
end;

function lcp(x,y:longint):longint;
var t:longint;
begin
 x:=rank[x]; y:=rank[y];
 if x>y then swap(x,y);
 if x<y then inc(x);
 t:=trunc(ln(y-x+)/ln());
 exit(min(f[x,t],f[y-<<t+,t]));
end;

procedure solve;
var m,l,i,j,tmp,t,ans,cnt:longint;
 pd:boolean;
begin
 init;
 fillchar(rec,sizeof(rec),);
 ans:=;
 for l:=  to n- do
  begin
   i:=;
   while i+l<=n do
    begin
     m:=lcp(i,i+l);
     tmp:=m div l+;
     t:=l-m mod l;
     t:=i-t;
     if (t>) and (m mod l<>) and (lcp(t,t+l)>=m) then inc(tmp);
     if tmp>ans then
      begin
       cnt:=;
       rec[]:=l;
       ans:=tmp;
      end;
     if cnt=ans then
      begin
       inc(cnt);
       rec[cnt]:=l;
      end;
     i:=i+l;
    end;
  end;
 pd:=false;
 for i:=  to n do
  if not pd then
   for j:=  to cnt do
    begin
     l:=rec[j];
     if lcp(sa[i],sa[i]+l)>=(ans-)*l then
      begin
       t:=sa[i];
       l:=l*ans;
       pd:=true;
       break;
      end;
    end
  else break;
 inc(cas);
 write('Case ',cas,': ');
 for i:= t to t+l- do write(s[i]);
 writeln;
end;

Begin
 cas:=;
 readln(s);
 while s[]<>'#' do
  begin
   solve;
   readln(s);
  end;
End.