【POJ2774】Long Long Message （后缀数组）

Long Long Message

Description

The little cat is majoring in physics in the capital of Byterland. A piece of sad news comes to him these days: his mother is getting ill. Being worried about spending so much on railway tickets (Byterland is such a big country, and he has to spend 16 shours on train to his hometown), he decided only to send SMS with his mother.

The little cat lives in an unrich family, so he frequently comes to the mobile service center, to check how much money he has spent on SMS. Yesterday, the computer of service center was broken, and printed two very long messages. The brilliant little cat soon found out:

1. All characters in messages are lowercase Latin letters, without punctuations and spaces. 
2. All SMS has been appended to each other – (i+1)-th SMS comes directly after the i-th one – that is why those two messages are quite long. 
3. His own SMS has been appended together, but possibly a great many redundancy characters appear leftwards and rightwards due to the broken computer. 
E.g: if his SMS is “motheriloveyou”, either long message printed by that machine, would possibly be one of “hahamotheriloveyou”, “motheriloveyoureally”, “motheriloveyouornot”, “bbbmotheriloveyouaaa”, etc. 
4. For these broken issues, the little cat has printed his original text twice (so there appears two very long messages). Even though the original text remains the same in two printed messages, the redundancy characters on both sides would be possibly different.

You are given those two very long messages, and you have to output the length of the longest possible original text written by the little cat.

Background: 
The SMS in Byterland mobile service are charging in dollars-per-byte. That is why the little cat is worrying about how long could the longest original text be.

Why ask you to write a program? There are four resions: 
1. The little cat is so busy these days with physics lessons; 
2. The little cat wants to keep what he said to his mother seceret; 
3. POJ is such a great Online Judge; 
4. The little cat wants to earn some money from POJ, and try to persuade his mother to see the doctor :( 

Input

Two strings with lowercase letters on two of the input lines individually. Number of characters in each one will never exceed 100000.

Output

A single line with a single integer number – what is the maximum length of the original text written by the little cat.

Sample Input

yeshowmuchiloveyoumydearmotherreallyicannotbelieveit
yeaphowmuchiloveyoumydearmother

Sample Output

27

【题意】

　　给你两串字符，要你找出在这两串字符中都出现过的最长子串。

【分析】

　　把两个串拼起来，中间插入特殊字符。

　　for一遍，用相邻的A、B串的LCP更新到ans中即可。

代码如下：

 #include<cstdio>
 #include<cstdlib>
 #include<cstring>
 #include<iostream>
 #include<algorithm>
 #include<queue>
 using namespace std;
 #define INF 0xfffffff
 #define Maxl 200010
 #define Mod 256

 int k,la;
 char a[Maxl],b[Maxl];
 int c[Maxl];
 int cl;

 int sa[Maxl],rk[Maxl],Rs[Maxl],wr[Maxl],y[Maxl];
 //sa -> 排名第几的是谁
 //rk -> i的排名
 //Rs数值小于等于i的有多少个
 //y -> 第二关键字排名第几的是谁（类似sa）
 int height[Maxl];

 int mymin(int x,int y) {return x<y?x:y;}
 int mymax(int x,int y) {return x>y?x:y;}

 void get_sa(int m)
 {
    memcpy(rk,c,sizeof(rk));
     for(int i=;i<=m;i++) Rs[i]=;
     for(int i=;i<=cl;i++) Rs[rk[i]]++;
     for(int i=;i<=m;i++) Rs[i]+=Rs[i-];
     for(int i=cl;i>=;i--) sa[Rs[rk[i]]--]=i;

     int ln=,p=;
     while(p<cl)
     {
        int k=;
         for(int i=cl-ln+;i<=cl;i++) y[++k]=i;
         for(int i=;i<=cl;i++) if(sa[i]>ln) y[++k]=sa[i]-ln;
         for(int i=;i<=cl;i++) wr[i]=rk[y[i]];

         for(int i=;i<=m;i++) Rs[i]=;
         for(int i=;i<=cl;i++) Rs[wr[i]]++;
         for(int i=;i<=m;i++) Rs[i]+=Rs[i-];
         for(int i=cl;i>=;i--) sa[Rs[wr[i]]--]=y[i];

         for(int i=;i<=cl;i++) wr[i]=rk[i];
         for(int i=cl+;i<=cl+ln;i++) wr[i]=;
         p=;rk[sa[]]=;
         for(int i=;i<=cl;i++)
         {
             if(wr[sa[i]]!=wr[sa[i-]]||wr[sa[i]+ln]!=wr[sa[i-]+ln]) p++;
             rk[sa[i]]=p;
         }
         m=p,ln*=;
     }
     sa[]=rk[]=;
 }

 void get_he()
 {
     int kk=;
     for(int i=;i<=cl;i++)
     {
         int j=sa[rk[i]-];
         if(kk) kk--;
         while(c[i+kk]==c[j+kk]&&i+kk<=cl&&j+kk<=cl) kk++;
         height[rk[i]]=kk;
     }
 }

 void ffind()
 {
     int na=INF,nb=INF,ans=;
     for(int i=;i<cl;i++)
     {
         if(sa[i]<=la) //a串
         {
             if(nb<=cl) ans=mymax(nb,ans),
             nb=mymin(nb,height[i+]);
             na=height[i+];
         }
         else //b串
         {
             if(na<=cl) ans=mymax(na,ans),
             na=mymin(na,height[i+]);
             nb=height[i+];
         }
     }
     printf("%d\n",ans);
 }

 void init()
 {
     scanf("%s%s",a,b);
     int l=strlen(a);la=l;
     for(int i=;i<l;i++) c[++cl]=a[i]-'a'+;
     l=strlen(b);
     c[++cl]=;
     for(int i=;i<l;i++) c[++cl]=b[i]-'a'+;
 }

 int main()
 {
     init();
     get_sa();
     get_he();
     ffind();
     return ;
 }

[POJ2774]

2016-07-17 16:38:16