杭电1503 LCS+字符串合并
来源:互联网 发布:淘宝大学官网 编辑:程序博客网 时间:2024/05/17 02:53
Advanced Fruits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2998 Accepted Submission(s): 1534
Special Judge
Problem Description
The company "21st Century Fruits" has specialized in creating new sorts of fruits by transferring genes from one fruit into the genome of another one. Most times this method doesn't work, but sometimes, in very rare cases, a new fruit emerges that tastes like a mixture between both of them.
A big topic of discussion inside the company is "How should the new creations be called?" A mixture between an apple and a pear could be called an apple-pear, of course, but this doesn't sound very interesting. The boss finally decides to use the shortest string that contains both names of the original fruits as sub-strings as the new name. For instance, "applear" contains "apple" and "pear" (APPLEar and apPlEAR), and there is no shorter string that has the same property.
A combination of a cranberry and a boysenberry would therefore be called a "boysecranberry" or a "craboysenberry", for example.
Your job is to write a program that computes such a shortest name for a combination of two given fruits. Your algorithm should be efficient, otherwise it is unlikely that it will execute in the alloted time for long fruit names.
A big topic of discussion inside the company is "How should the new creations be called?" A mixture between an apple and a pear could be called an apple-pear, of course, but this doesn't sound very interesting. The boss finally decides to use the shortest string that contains both names of the original fruits as sub-strings as the new name. For instance, "applear" contains "apple" and "pear" (APPLEar and apPlEAR), and there is no shorter string that has the same property.
A combination of a cranberry and a boysenberry would therefore be called a "boysecranberry" or a "craboysenberry", for example.
Your job is to write a program that computes such a shortest name for a combination of two given fruits. Your algorithm should be efficient, otherwise it is unlikely that it will execute in the alloted time for long fruit names.
Input
Each line of the input contains two strings that represent the names of the fruits that should be combined. All names have a maximum length of 100 and only consist of alphabetic characters.
Input is terminated by end of file.
Input is terminated by end of file.
Output
For each test case, output the shortest name of the resulting fruit on one line. If more than one shortest name is possible, any one is acceptable.
Sample Input
apple peachananas bananapear peach
Sample Output
appleachbananaspearch
题意:给出两个字符串,要求合并,但公共子串部分只输出一次。
思路:找出两个串的LCS,存在第三个串中,然后按序依次输出三个串中需要输出的部分。输出时比较难处理,第三个串S3用结构体存储,结构体还包括i,j分别代表公共子串各字符在S1串和S2串的位置。
AC代码:
/*不能保证所述全部正确,如有不足之处,还请前辈指出*/#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;char s1[1005],s2[1005];int dp[1005][1005];struct ss{ int i,j; char c;}s3[1005];int main(){ // freopen("D://in.txt","r",stdin); int l1,l2,k=0; while(~scanf("%s %s",s1,s2)) { l1=strlen(s1); l2=strlen(s2); memset(dp,0,sizeof(dp)); for(int i=1;i<=l1;i++) { for(int j=1;j<=l2;j++) { if(s1[i-1]==s2[j-1]) dp[i][j]=dp[i-1][j-1]+1; else dp[i][j]=max(dp[i][j-1],dp[i-1][j]); } } k=0; for(int i=l1,j=l2;i>=1&&j>=1;) { if(s1[i-1]==s2[j-1]) { s3[k].c=s1[i-1]; s3[k].i=i-1; s3[k].j=j-1; i--; j--; k++; } else if(dp[i][j-1]>dp[i-1][j]) j--; else i--; } int i=0,j=0; for(k--;k>=0;--k) { for(;s3[k].i!=i;i++) printf("%c",s1[i]); for(;s3[k].j!=j;j++) printf("%c",s2[j]); printf("%c",s3[k].c); ++i,++j; } for(;s1[i]!='\0';i++) printf("%c",s1[i]); for(;s2[j]!='\0';j++) printf("%c",s2[j]); printf("\n"); } return 0;}
0 0
- 杭电1503 LCS+字符串合并
- 杭电 1503 Advanced Fruits(lcs)
- 杭电acm 5495 LCS
- Advanced Fruits HDU杭电1503【LCS的保存】
- 杭电 1513 Palindrome LCS DP
- 杭电 1513 Palindrome(LCS)
- 杭电-1159Common Subsequence(LCS)
- 杭电-4545魔法串(LCS)
- hdoj 1503 Advanced Fruits (LCS 变形合并)
- 【2016杭电女生赛1006】【DP 类似LCS】Combine String 字符串c拆子串 能否恰好分成a与b
- 杭电1080-Lcs+DP(**有借鉴**)
- 杭电1159(Common Subsequence)LCS和dp
- Common Subsequence 杭电HDU1159 【动态规划LCS】
- 杭电-1513Palindrome(LCS+滚动数组)
- 杭电-1257最少拦截系统(LCS变形)
- 杭电 字符串
- 三个字符串的LCS
- NYOJ37回文字符串【LCS】
- 交叉排序
- 注释转换项目
- DOS批处理命令之start命令
- angularjs ui-router 动态切换视图到指定的ui-view中
- C 和C++结构体的区别
- 杭电1503 LCS+字符串合并
- 51NOD1042——1042 数字0-9的数量(数位dp)
- 使用scp上传文件不用输密码的方法
- Neo4j-Cypher语言
- QTabBar关闭按钮图标
- 144 Linux使用jstat命令查看jvm的GC情况
- 幼儿园都教什么?
- 微信自动回复和自动抢红包实现原理(一):AccessibilityService的介绍和配置
- SessionFactory (org.hibernate.SessionFactory)