HDOJ 题目1503 Advanced Fruits(LCS 递归,模板)
2014-11-21 14:03
381 查看
Advanced Fruits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1624 Accepted Submission(s): 840
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.
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
Source
University of Ulm Local Contest 1999
Recommend
linle | We have carefully selected several similar problems for you: 1502 1501 1227 1080 1158
最后一个输出的实际上是pearchr
ac代码
#include<stdio.h> #include<string.h> int map[1010][1010],dp[1010][1010]; char s1[1010],s2[1010]; void Lcs(int len1,int len2) { int i,j; for(i=0;i<=len1;i++) { map[i][0]=0; } for(j=0;j<=len2;j++) map[0][j]=-1; for(i=1;i<=len1;i++) { for(j=1;j<=len2;j++) { if(s1[i-1]==s2[j-1]) { map[i][j]=1; dp[i][j]=dp[i-1][j-1]+1; } else { if(dp[i-1][j]>=dp[i][j-1]) { dp[i][j]=dp[i-1][j]; map[i][j]=0; } else { dp[i][j]=dp[i][j-1]; map[i][j]=-1; } } } } } void printfl(int i,int j) { if(i==0&&j==0) return; if(map[i][j]==1) { printfl(i-1,j-1); printf("%c",s1[i-1]); } else if(map[i][j]==0) { printfl(i-1,j); printf("%c",s1[i-1]); } else if(map[i][j]==-1) { printfl(i,j-1); printf("%c",s2[j-1]); } } int main() { //char s1[1001],s2[1001]; int len1,len2; while(scanf("%s%s",s1,s2)!=EOF) { // memset(map,0,sizeof(map)); len1=strlen(s1); len2=strlen(s2); memset(dp,0,sizeof(dp)); Lcs(len1,len2); printfl(len1,len2); printf("\n"); } }
相关文章推荐
- HDU 1503Advanced Fruits LCS变形之字母存储+递归
- hdoj-1503-Advanced Fruits【LCS】
- HDU-1503 Advanced Fruits(LCS)
- HDOJ_杭电2044_一只小蜜蜂,递归题目
- HDOJ 题目1561 The more, The Better(树状dp,模板)
- HDOJ, 杭电2042, 不容易系列之二。。。递归题目。。
- HDOJ_杭电2085_核反应堆,简单递归题目
- HDOJ 题目1083Courses(二分图匹配,匈牙利算法模板)
- HDOJ-1503 Advanced Fruits
- HDOJ题目1997汉诺塔VII(递归)
- HDOJ-1503-Advanced Fruits
- HDOJ 题目1251统计难题(字典树,模板)
- HDU 1503 Advanced Fruits(LCS)
- HDU 1503 Advanced Fruits(LCS+输出路径)
- HDU 1503 Advanced Fruits(LCS+输出路径~)
- HDOJ题目1392Surround the Trees(数学几何,凸包模板)
- hdoj_1503Advanced Fruits
- HDU 1503 Advanced Fruits【LCS】
- hdu 1503:Advanced Fruits(动态规划 DP & 最长公共子序列(LCS)问题升级版)
- HDOJ 题目3635Dragon Balls(带权值的并查集,模板)