poj 2264 Advanced Fruits lcs
来源:互联网 发布:php 时间查询 编辑:程序博客网 时间:2024/06/05 11:13
Advanced Fruits
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2152 Accepted: 1062 Special Judge
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
把两个串给合并输出
ACcode:
#include <map>#include <queue>#include <cmath>#include <cstdio>#include <cstring>#include <stdlib.h>#include <iostream>#include <algorithm>#define maxn 1005using namespace std;int dp[maxn][maxn];char mystack[maxn];char s1[maxn],s2[maxn];int main(){ while(scanf("%s%s",s1+1,s2+1)!=EOF){ memset(dp,0,sizeof(dp)); int lena=strlen(s1+1),lenb=strlen(s2+1); for(int i=1;i<=lena;++i) for(int j=1;j<=lenb;++j) if(s1[i]==s2[j]) dp[i][j]=dp[i-1][j-1]+1; else dp[i][j]=max(dp[i-1][j],dp[i][j-1]); int t=1,i=lena,j=lenb; while(dp[i][j]){ if(s1[i]==s2[j]){ mystack[t++]=s1[i];i--;j--; } else if(dp[i-1][j]>dp[i][j-1]){ mystack[t++]=s1[i]; i--; } else{ mystack[t++]=s2[j]; j--; } } while(i>=1)mystack[t++]=s1[i--]; while(j>=1)mystack[t++]=s2[j--]; for(i=t-1;i>0;--i)putchar(mystack[i]); putchar('\n'); } return 0;}/*apple peachananas bananapear peachcranberry boysenberry*/
0 0
- poj 2264 Advanced Fruits lcs
- poj 2264 Advanced Fruits dp解LCS的对偶问题
- poj-2264-Advanced Fruits【LCS】(回溯输出)
- poj 2264 Advanced Fruits
- POJ 2264 Advanced Fruits
- 【poj 2264】 Advanced Fruits
- HDU1503:Advanced Fruits(LCS)
- HDU1503:Advanced Fruits 【LCS】
- Advanced Fruits(HDU1503)LCS
- lcs hdu1503 Advanced Fruits
- hdu1503 Advanced Fruits (LCS)
- poj 2264 Advanced Fruits(DP)
- ZOJ 1953 Advanced Fruits(LCS)
- HDU 1503 Advanced Fruits[ LCS ]
- hdu 1503 Advanced Fruits (LCS)
- HDU 1503--Advanced Fruits【LCS】
- POJ2264 HDU1503 Advanced Fruits【LCS】
- HDOJ 1503 Advanced Fruits(LCS)
- 使用命令行编译打包运行自己的MapReduce程序 Hadoop2.7.2
- [学习笔记]jsp web.xml文件的作用及基本配置
- [学习笔记]Java如何处理EXCEL的读取
- IOS开发笔记——禁用手势滑动返回功能
- [学习笔记]使用java读取Excel表格中的数据
- poj 2264 Advanced Fruits lcs
- [学习笔记]EXCEL导入功能java代码实现
- hibernate对象的三种状态
- [学习笔记]用Javascript实现Windows任务管理器
- 迅雷影音 win10安装不上的问题
- Android UI高级之Menu
- [学习笔记]Java排序算法:希尔排序(Shell排序)
- Android 插件化 动态升级
- [学习笔记]Java排序算法之归并排序