HDOJ 1503 Advanced Fruits
来源:互联网 发布:ukec中介怎么样 知乎 编辑:程序博客网 时间:2024/06/07 11:59
Advanced Fruits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2956 Accepted Submission(s): 1502
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
Source
University of Ulm Local Contest 1999
Recommend
linle
厄,这也是个模板题。应该是用dfs找到得出的序列……
说实话模板我没看太懂(主要是搜索学的奇差无比OTZ),先抄上,以后再理解理解。
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;char ch1[1010],ch2[1010];int dp[1010][1010],g[1010][1010];int l1,l2;void LCS(){int i,j;memset(dp,0,sizeof(dp));for(i=0;i<=l1;i++)g[i][0]=1;for(i=0;i<=l2;i++)g[0][i]=-1;for(i=1;i<=l1;i++){for(j=1;j<=l2;j++){if(ch1[i-1]==ch2[j-1]){dp[i][j]=dp[i-1][j-1]+1;g[i][j]=0;}else if(dp[i-1][j]>=dp[i][j-1]){dp[i][j]=dp[i-1][j];g[i][j]=1;}else{dp[i][j]=dp[i][j-1];g[i][j]=-1;}}}}void printLCS(int i,int j){if(!i&&!j) return;if(g[i][j]==0){printLCS(i-1,j-1);printf("%c",ch1[i-1]);}else if(g[i][j]==1){printLCS(i-1,j);printf("%c",ch1[i-1]);}else{printLCS(i,j-1);printf("%c",ch2[j-1]);}}int main(){while(~scanf("%s%s",ch1,ch2)){l1=strlen(ch1);l2=strlen(ch2);LCS();printLCS(l1,l2);printf("\n");}return 0;}
0 0
- HDOJ--1503 Advanced Fruits
- HDOJ-1503-Advanced Fruits
- HDOJ-1503 Advanced Fruits
- HDOJ 1503 Advanced Fruits
- HDOJ 1503 Advanced Fruits(LCS)
- hdoj-1503-Advanced Fruits【LCS】
- HDOJ 1503 Advanced Fruits(LCS+记录路径)
- hdoj 1503 Advanced Fruits (LCS 变形合并)
- HDOJ 题目1503 Advanced Fruits(LCS 递归,模板)
- hdoj 1503 Advanced Fruits 【最长公共子序列 变形】
- HDOJ 1503 Advanced Fruits (最长公共子序列 LCS)
- HDU 1503 Advanced Fruits
- HDU 1503 Advanced Fruits
- HDU 1503 - Advanced Fruits
- hdu 1503 Advanced Fruits
- 1503 Advanced Fruits
- hdu 1503 Advanced Fruits
- hdu 1503 Advanced Fruits
- Redis主从复制配置信息
- HIVE 安装指南
- 常用正则表达式
- TensorFlow结构分析及自定义Op
- leetcode(90):Subsets II
- HDOJ 1503 Advanced Fruits
- 2016多校训练Contest8: 1011 Rikka with Parenthesis II hdu5831
- yii2 请求处理过程解析
- 笔记16 Animator 安卓属性动画 三种实现方式及监听事件实现
- hdu5823color II
- Ionic+Angularjs+Cordova开发跨平台混合式移动应用
- StringBuilder 追加 append 截取 delete
- go监听随机端口
- 《深入理解计算机系统》之代码优化