Advanced Fruits
来源:互联网 发布:红顶位面商人知轩 编辑:程序博客网 时间:2024/06/02 06:48
B - Advanced Fruits
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription
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
模板题,就是把两个字符串合并成一个输出,然后公共字串输出一次,还有就是在原字符串位置靠前的优先输出。
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;const int maxn = 110;char s1[maxn],s2[maxn];int dp[maxn][maxn];int vis[maxn][maxn];void LCS(int l1,int l2){if(!l1 && !l2)return;if(vis[l1][l2] == 1){LCS(l1-1,l2-1);printf("%c",s1[l1-1]);}else if(vis[l1][l2] == 2){LCS(l1-1,l2);printf("%c",s1[l1-1]);}else{LCS(l1,l2-1);printf("%c",s2[l2-1]);}}int main(){while(scanf("%s %s",s1,s2) != EOF){int l1 = strlen(s1);int l2 = strlen(s2);for(int i=0; i<=l1; i++){dp[i][0] = 0;vis[i][0] = 2;}for(int i=0; i<=l2; i++){dp[0][i] = 0;vis[0][i] = 3;}for(int i=1; i<=l1; i++){for(int j=1; j<=l2; 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(l1,l2);printf("\n");}return 0;}
0 0
- Advanced Fruits
- Advanced Fruits
- Advanced Fruits
- Advanced Fruits
- Advanced Fruits
- 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
- hdu 1503 advanced fruits
- poj 2264 Advanced Fruits
- HDU1503:Advanced Fruits(LCS)
- POJ 2264 Advanced Fruits
- HDU 1503 Advanced Fruits
- hdu 1503 Advanced Fruits
- 数据库操作
- Android混淆编译、反混淆、反编译
- uva11270Tiling Dominoes
- HDU 3652 裸数位DP
- 论表单设计规范
- Advanced Fruits
- JAVA学习代码——数组排序
- 实数
- 学习笔记(四)SharedPreferences与文件管理
- 使用Cocos2d时关联源码问题解决
- 分布式存储基本概念
- C++ Primer 第17章 知识点回顾
- 谍影重重5 百度云/迅雷/BT种子1080P高清版下载
- java中String的粗浅使用