POJ 2264 Advanced Fruits
来源:互联网 发布:科大讯飞同声翻译软件 编辑:程序博客网 时间:2024/06/06 04:15
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
Ulm Local 1999
题目本身没什么,就LCS,主要练习带递归的输出
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn=110;char s1[maxn],s2[maxn];int mark[maxn][maxn];int dp[maxn][maxn];int len1,len2;void LCS(){ memset(dp,0,sizeof(dp)); for(int i=0;i<=len1;i++) mark[i][0]=1; for(int j=1;j<=len2;j++) mark[0][j]=-1; for(int i=1;i<=len1;i++) { for(int 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 print(int i,int j)//带递归的输出练习{ if(i==0&&j==0) return ; if(mark[i][j]==0) { print(i-1,j-1); printf("%c",s1[i-1]); } else if(mark[i][j]==1) { print(i-1,j); printf("%c",s1[i-1]); } else { print(i,j-1); printf("%c",s2[j-1]); }}int main(){ while(~scanf("%s%s",s1,s2)) { len1=strlen(s1); len2=strlen(s2); LCS(); print(len1,len2); printf("\n"); } return 0;}
1 0
- poj 2264 Advanced Fruits
- POJ 2264 Advanced Fruits
- 【poj 2264】 Advanced Fruits
- poj 2264 Advanced Fruits(DP)
- poj 2264 Advanced Fruits lcs
- POJ 2264 Advanced Fruits DP+记录路径
- POJ 2264 Advanced Fruits(最长公共子序列)
- POJ 2264 Advanced Fruits--最长公共子序列
- poj 2264 Advanced Fruits dp解LCS的对偶问题
- poj-2264-Advanced Fruits【LCS】(回溯输出)
- Advanced Fruits
- Advanced Fruits
- Advanced Fruits
- Advanced Fruits
- Advanced Fruits
- HDU 1503 Advanced Fruits
- HDU 1503 Advanced Fruits
- HDU 1503 - Advanced Fruits
- Category & Extension
- hdu4864 贪心
- 未来篇章
- dfs 和 bfs 解析
- [Phonegap+Sencha Touch] 移动开发1、准备工作
- POJ 2264 Advanced Fruits
- 将两个排好序的数组,合并到另外一个数组中,并且合并之后的数组也是有序的。
- Angular学习(九)——Hidding和Showing
- TOJ 1680. Crazy tea party
- Delphi之多线程编程(一)
- JAVA 使用Dom4j 解析XML
- 重定向输出流
- kvm中虚拟机的硬盘扩容
- c++数组