HDU 1503 Advance Fruits
来源:互联网 发布:海文网络计划软件使用 编辑:程序博客网 时间:2024/06/07 04:51
Advanced Fruits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3345 Accepted Submission(s): 1719
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
#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>using namespace std;const int maxn = 210;int dp[maxn][maxn];char str1[maxn], str2[maxn];bool vis1[maxn], vis2[maxn];int main() { //input; int len1, len2; while (~scanf("%s %s", str1, str2)) { //输入两个字符串 len1 = strlen(str1); //长度 len2 = strlen(str2); //长度 //求出最长公共子串 for (int i = 1; i <= len1; i ++) { for (int j = 1; j <= len2; j ++) { if (str1[i-1] == str2[j-1]) { dp[i][j] = dp[i-1][j-1] + 1; } else dp[i][j] = max(dp[i-1][j], dp[i][j-1]); } } //初始化 memset(vis1, 0, sizeof(vis1)); memset(vis2, 0, sizeof(vis2)); if (dp[len1][len2] == 0) printf("%s%s\n", str1, str2); else { int i = len1, j = len2; int cur = 0; while (i && j) { if ((dp[i][j] == dp[i-1][j-1] + 1) && (str1[i-1] == str2[j-1])) { i --; j --; vis1[i] = true; vis2[j] = true; } else if (dp[i-1][j] > dp[i][j-1]) i --; else j --; } i = 0; j = 0; while (1) { while (!vis1[i] && i < len1) printf("%c", str1[i ++]); while (!vis2[j] && j < len2) printf("%c", str2[j ++]); if (vis1[i] && i < len1) { printf("%c", str1[i ++]); j ++; } if (i >= len1 && j >= len2) break; } printf("\n"); } } return 0;}
0 0
- HDU 1503 Advance Fruits
- HDU 1503 Advanced Fruits
- HDU 1503 Advanced Fruits
- HDU 1503 - Advanced Fruits
- hdu 1503 Advanced Fruits
- hdu 1503 Advanced Fruits
- hdu 1503 Advanced Fruits
- hdu 1503 advanced fruits
- HDU 1503 Advanced Fruits
- hdu 1503 Advanced Fruits
- hdu 1503 Advanced Fruits
- hdu 1503 Advanced fruits
- HDU 1503 Advanced Fruits
- hdu 1503 Advanced Fruits
- hdu 1503 Advanced Fruits
- HDU 1503 Advanced Fruits
- HDU 1503 Advanced Fruits
- HDU-1503 Advanced Fruits
- mysql捕捉异常
- form表单中的input有哪些类型及其用途
- nginx启用Userdir【nginx】
- [牛客]交换练习题
- 设计一个简易计算器
- HDU 1503 Advance Fruits
- LeetCode 328. Odd Even Linked List
- 输出图案(五)---输出心形图案:(难度系数:1颗星)
- 基于Vue 2.0高仿 <今日头条> 单页应用 —— vue-toutiao
- nginx启用虚拟主机【nginx】
- 汇编程序:用子程序实现求幂
- 关于viewpager+tablayout.切换pager生命周期方法的问题
- [leetCode刷题笔记]491. Increasing Subsequences
- Emacs&&Lisp学习