HDU 1503--Advanced Fruits【LCS】
来源:互联网 发布:dnf决战人工智能 编辑:程序博客网 时间:2024/06/15 11:57
Advanced Fruits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1738 Accepted Submission(s): 897
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
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;char s1[1100];char s2[1100];int len1,len2;int dp[1100][1100];int mark[1100][1100];//标记方向 void LCS(){ int i,j; memset(dp,0,sizeof(dp)); for(i = 0;i <= len1;++i) mark[i][0] = 1;//向上 for(j = 0;j <= len2;++j) mark[0][j] = -1;//向左 for(i = 1;i <= len1;++i) for(j = 1;j <= len2;++j){ if(s1[i-1] == s2[j-1]){ dp[i][j] = dp[i-1][j-1]+1; mark[i][j] = 0;//左上 } else{if(dp[i-1][j] >= dp[i][j-1]){ dp[i][j] = dp[i-1][j]; mark[i][j] = 1;//上 } else { dp[i][j] = dp[i][j-1]; mark[i][j] = -1;//左 } } }}void PrintLCS(int i,int j){ if(!i && !j) return ; if(mark[i][j] == 0){ PrintLCS(i-1,j-1);//回溯 printf("%c",s1[i-1]); } else if(mark[i][j] == 1){ PrintLCS(i-1,j); printf("%c",s1[i-1]); } else if(mark[i][j] == -1){ PrintLCS(i,j-1); printf("%c",s2[j-1]); }}int main (){ while(scanf("%s%s",s1,s2)!=EOF){ len1=strlen(s1); len2=strlen(s2); LCS(); PrintLCS(len1,len2); printf("\n"); } return 0;}
0 0
- HDU 1503 Advanced Fruits[ LCS ]
- hdu 1503 Advanced Fruits (LCS)
- HDU 1503--Advanced Fruits【LCS】
- HDU 1503 Advanced Fruits(LCS)
- HDU 1503 Advanced Fruits LCS -
- HDU 1503 Advanced Fruits【LCS】
- HDU-1503 Advanced Fruits(LCS)
- hdu 1503 Advanced Fruits DP LCS
- hdu 1503 Advanced Fruits(LCS)
- HDU 1503 Advanced Fruits (LCS,DP)
- hdu 1503 Advanced Fruits (LCS)
- HDU 1503 Advanced Fruits (LCS升级版)
- HDU 1503 Advanced Fruits (LCS)
- hdu 1503 Advanced Fruits 打印LCS模板
- HDU 1503-Advanced Fruits(动态规划,LCS)
- HDU-1503 Advanced Fruits(DP LCS)
- HDOJ 1503 Advanced Fruits(LCS)
- hdoj-1503-Advanced Fruits【LCS】
- cocos2d-x-3.5 中new 出来的对象大部分是如何处理的
- android4.4以上调用图库的方法
- 好玩的Linux命令
- 单词数 HDU 2072
- Android 序列化对象Parcelable 的使用
- HDU 1503--Advanced Fruits【LCS】
- 黑马程序员——基础学习
- sun.misc.unsafe类的使用
- iOS之同步请求、异步请求、GET请求、POST请求
- Android图像处理——Paint之ColorFilter
- web表格插件绘制多项甘特图
- PHP CodeIgniter(CI)框架中去掉 index.php方法
- 演示如何使用QTableView显示列表
- 关于睡眠你应该知道的十件事