【HDU 杭电 1503 Advanced Fruits】
来源:互联网 发布:开淘宝店要考试吗 编辑:程序博客网 时间:2024/04/30 14:52
Advanced Fruits
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.
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.
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 peach
ananas banana
pear peach
Sample Output
appleach
bananas
pearch
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;char s1[110];char s2[110];int dp[110][110];int vis[110][110];void lcs(int a,int b){ if(!a&&!b) return ;//从末尾开始回溯,实际是从开头开始输出 if(vis[a][b]==1) { lcs(a-1,b-1); printf("%c",s1[a-1]); } else if(vis[a][b]==2)//输出之前在当前位置储存的字符 { lcs(a-1,b); printf("%c",s1[a-1]); } else { lcs(a,b-1); printf("%c",s2[b-1]); } return ;}int main(){ int i,j; int mla,mlb; while(scanf("%s %s",s1,s2)!=EOF) { mla=strlen(s1); mlb=strlen(s2); for(i=0;i<=mla;i++)//初始化数组 { dp[i][0]=0; vis[i][0]=2; } for(i=0;i<=mlb;i++) { dp[0][i]=0; vis[0][i]=3; } for(i=1;i<=mla;i++) { for(j=1;j<=mlb;j++) { if(s1[i-1]==s2[j-1]) { dp[i][j]=dp[i-1][j-1]+1; vis[i][j]=1;//记录每个位置储存的怎样字符 } else { if(dp[i-1][j]>dp[i][j-1])//怎样储存字符,取当前相同字符串的最长的储存,避免覆盖 { dp[i][j]=dp[i-1][j]; vis[i][j]=2; } else { dp[i][j]=dp[i][j-1]; vis[i][j]=3; } } } } lcs(mla,mlb); printf("\n"); } return 0;}
- 【HDU 杭电 1503 Advanced Fruits】
- Advanced Fruits HDU杭电1503【LCS的保存】
- 杭电1503(Advanced Fruits)
- 杭电 1503 Advanced Fruits(lcs)
- HDU 1503 Advanced Fruits
- HDU 1503 Advanced Fruits
- HDU 1503 - Advanced Fruits
- hdu 1503 Advanced Fruits
- hdu 1503 Advanced Fruits
- hdu 1503 Advanced Fruits
- hdu 1503 advanced fruits
- HDU 1503 Advanced Fruits
- hdu 1503 Advanced Fruits
- hdu 1503 Advanced Fruits
- hdu 1503 Advanced fruits
- HDU 1503 Advanced Fruits
- hdu 1503 Advanced Fruits
- hdu 1503 Advanced Fruits
- Android 中使用ImageView实现播放Gif图片功能
- Java中通过输入输出流进行文件的读写
- 2015年10月12日
- HTML <b>粗体文本
- 2015年10月13日
- 【HDU 杭电 1503 Advanced Fruits】
- Java I/O通过输入输出流进行文件读写(二)用户界面
- Spring MVC开发环境搭建
- 2015年10月15日
- 2015年10月17日
- Java 文件加密传输与解密算法终极产品版(三)
- 2015年10月17日
- 2015年10月17日
- 数据库基础入门(一)