POJ 2774 Long Long Message(2.3 求两个字符串的最长公共子串)
2015-09-17 17:26
190 查看
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
Sample Output
分析:求两个字符串的最常公共子串
对于SA来说,相邻rank无疑具有最大的相似度,所以求得相邻且在不同子串的SA的height即为答案
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
分析:求两个字符串的最常公共子串
对于SA来说,相邻rank无疑具有最大的相似度,所以求得相邻且在不同子串的SA的height即为答案
#include<cstdio> #include<cstring> #include<algorithm> #include<vector> #include<string> #include<iostream> #include<queue> #include<cmath> #include<map> #include<stack> #include<set> using namespace std; #define REPF( i , a , b ) for ( int i = a ; i <= b ; ++ i ) #define REP( i , n ) for ( int i = 0 ; i < n ; ++ i ) #define CLEAR( a , x ) memset ( a , x , sizeof a ) const int INF=0x3f3f3f3f; typedef long long LL; const int maxn=2e5+100; int wa[maxn],wb[maxn],wsf[maxn],wv[maxn],sa[maxn]; int ran[maxn],height[maxn],s[maxn]; char s1[maxn],s2[maxn]; int cmp(int *r,int a,int b,int k) { return r[a]==r[b]&&r[a+k]==r[b+k]; } void da(int *r,int *sa,int n,int m) { int i,j,p,*x=wa,*y=wb,*t; for(i=0;i<m;i++) wsf[i]=0; for(i=0;i<n;i++) wsf[x[i]=r[i]]++; for(i=1;i<m;i++) wsf[i]+=wsf[i-1]; for(i=n-1;i>=0;i--) sa[--wsf[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++) wsf[i]=0; for(i=0;i<n;i++) wsf[wv[i]]++; for(i=1;i<m;i++) wsf[i]+=wsf[i-1]; for(i=n-1;i>=0;i--) sa[--wsf[wv[i]]]=y[i]; for(t=x,x=y,y=t,x[sa[0]]=0,p=1,i=1;i<n;i++) x[sa[i]]=cmp(y,sa[i-1],sa[i],j)?p-1:p++; } return ; } void getheight(int *r,int n) { int i,j,k=0; for(i=1;i<=n;i++) ran[sa[i]]=i; for(i=0;i<n;height[ran[i++]]=k) for(k?k--:0,j=sa[ran[i]-1];r[i+k]==r[j+k];k++); return; } int main() { while(~scanf("%s%s",s1,s2)) { int len1=strlen(s1); int len2=strlen(s2); int n=0; for(int i=0;i<len1;i++) s[n++]=s1[i]-'a'+1; s ='$'; for(int i=0;i<len2;i++) s[n++]=s2[i]-'a'+1; s =0; da(s,sa,n+1,130);//s[0,n]-n+1 getheight(s,n); int ans=0; for(int i=2;i<n;i++) { if(height[i]>ans) { if(sa[i-1]>=0&&sa[i-1]<len1&&sa[i]>=len1) ans=max(ans,height[i]); if(sa[i]>=0&&sa[i]<len1&&sa[i-1]>=len1) ans=max(ans,height[i]); } } printf("%d\n",ans); } return 0; }
相关文章推荐
- linux下开发PHP扩展之安装篇
- UIday1604:get同步/异步 和 post同步/异步 编程实现
- CDN加速
- dns(域名系统)
- 跨域总结
- 同步请求和异步请求的区别
- Winform开发框架之单据窗体生成(主从表,流水单号)
- ubuntu 编译安装 mod_wsgi
- [视频]Win10 Mobile10536.1004预览版上手体验
- 第三周项目(3):顺序表的基本算法
- Spring MVC 简单实例
- Jersey: MessageBodyWriter not found for media type=application/json
- Shallow heap & Retained heap
- Advanced R之函数
- "esri/dijit/PopupMobile"这个应该可以在项目中创建一个可移动的窗体
- 语义网
- Axis2 转让Webservice 介面
- DJANGO不同应用之间的用户迁移
- 使用IConfigurationSectionHandler在web.config中增加自定义配置
- runlevel