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:
- All characters in messages are lowercase Latin letters, without punctuations and spaces.
- 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.
- 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.- 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 :(
【题目分析】
很水的一道后缀数组的题目,用来练手了(说的好像我真的会一样)。
其实是抄的别人的代码,感觉代码太漂亮了。写的多了一定就会更好的理解了。
大概就是求出了height值之后,找一个sa[i]和sa[i-1]再两个字符串当中但是height[i]值最大的一个就可以了。
在这个两个字符串合并后的字符串中,一定要最后多加一个0,否则会WA或者RE的。(虽然我也不知道为啥)
【代码】(参考2009年国家集训队论文——《后缀数组——处理字符串的有力工具》)
#include <cstdio>
#include <cstring>
#define maxn 200001
int t,wa[maxn],wb[maxn],wv[maxn],ws[maxn],sa[maxn],rank[maxn],height[maxn],s[maxn];
char s1[maxn],s2[maxn];
int cmp(int *r,int a,int b,int l)
{return r[a]==r[b]&&r[a+l]==r[b+l];}
inline void getsa(int *r,int *sa,int n,int m)
{
int i,j,p,*x=wa,*y=wb,*t;
for (i=0;i<m;++i) ws[i]=0;
for (i=0;i<n;++i) ws[x[i]=r[i]]++;
for (i=1;i<m;++i) ws[i]+=ws[i-1];
for (i=n-1;i>=0;--i) sa[--ws[x[i]]]=i;
for (j=1,p=1;p<n;j*=2,m=p)
{
for (p=0,i=n-j;i<n;++i) y[p++]=i;
for (i=0;i<n;++i) if (sa[i]>=j) y[p++]=sa[i]-j;
for (i=0;i<n;++i) wv[i]=x[y[i]];
for (i=0;i<m;++i) ws[i]=0;
for (i=0;i<n;++i) ws[wv[i]]++;
for (i=1;i<m;++i) ws[i]+=ws[i-1];
for (i=n-1;i>=0;--i) sa[--ws[wv[i]]]=y[i];
for (t=x,x=y,y=t,p=1,x[sa[0]]=0,i=1;i<n;++i)
x[sa[i]]=cmp(y,sa[i-1],sa[i],j)?p-1:p++;
}
}
inline void gethi(int *r,int n)
{
int i,j,k=0;
for (i=1;i<=n;++i) rank[sa[i]]=i;
for (i=0;i<n;height[rank[i++]]=k)
for (k?k--:0,j=sa[rank[i]-1];r[i+k]==r[j+k];k++);
}
int main()
{
scanf("%s",s1);
scanf("%s",s2);
int l1=strlen(s1),l2=strlen(s2);
for (int i=0;i<l1;++i) s[t++]=s1[i]-'a'+1;
s[t++]=28;
for (int i=0;i<l2;++i) s[t++]=s2[i]-'a'+1;
s[t]=0;
getsa(s,sa,t+1,30);
gethi(s,t);
int maxx=0;
for (int i=2;i<t;++i)
if (height[i]>maxx)
{
if(0<=sa[i-1]&&sa[i-1]<l1&&l1<sa[i]) maxx=height[i];
if(0<=sa[i]&&sa[i]<l1&&l1<sa[i-1]) maxx=height[i];
}
printf("%d\n",maxx);
return 0;
}