【HDU1503】【Advanced Fruits】
2015-08-05 19:18
351 查看
Advanced Fruits
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1943 Accepted Submission(s): 994
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.
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.
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 peach ananas banana pear peach
Sample Output
appleach bananas pearch
Source
University of Ulm Local Contest 1999
Recommend
linle
#include <iostream> #include <cstring> #include <cmath> #include <queue> #include <stack> #include <list> #include <map> #include <set> #include <string> #include <cstdlib> #include <cstdio> #include <algorithm> using namespace std; string a,b; int dp[110][110]; int p[110][110]; int l1,l2; void dfs(int x,int y) { if(x <= 0 && y <= 0) return ; if(p[x][y] == 1) { dfs(x-1,y-1); putchar(a[x]); } else if(p[x][y] == 2) { dfs(x,y-1); putchar(b[y]); } else if(p[x][y] == 3) { dfs(x-1,y); putchar(a[x]); } else { if(x >= 1) { dfs(x-1,y); putchar(a[x]); return; } if(y >= 1) { dfs(x,y-1); putchar(b[y]); return ; } } } int main() { while(cin>>a && cin>>b) { memset(dp,0,sizeof(dp)); memset(p,-1,sizeof(p)); a = " " + a; b = " " + b; l1 = a.length() - 1; l2 = b.length() - 1; for(int i=1;i<=l1;i++) { for(int j=1;j<=l2;j++) { if(a[i] == b[j]) { dp[i][j] = dp[i-1][j-1] + 1; p[i][j] = 1; } else { if(dp[i][j-1] > dp[i-1][j]) { dp[i][j] = dp[i][j-1]; p[i][j] = 2; } else if(dp[i][j-1] < dp[i-1][j]) { dp[i][j] = dp[i-1][j]; p[i][j] = 3; } else { dp[i][j] = dp[i-1][j]; p[i][j] = 4; } } } } dfs(l1,l2); cout <<endl; } return 0; }
相关文章推荐
- iOS开发之----根据文本内容和字体大小计算UILabel的size
- HDU 1509 Windows Message Queue(优先队列)
- UIPageControl(滑动图片时底下的圆点)
- [IOS]今天开始学UI---UIDatePicker
- ServerGuide 引导安装指南教程(图文)
- iOS UITableviewCell的重用机制
- UIScrollView(滑动切换图片,图片的循环切换(自动))
- Android酷炫实用的开源框架(UI框架)
- php中的include和require
- Devexpress控件库----ComboBoxEdit,MRUEdit,SearchContrl控件对比
- 【RequireJS 学习笔记】RequireJS 学习笔记 1 —— RequireJS 界的 Hello World
- 【RequireJS 学习笔记】RequireJS 学习笔记 1 —— RequireJS 界的 Hello World 2015-08-05 17:52 1人阅读 评论(0) 收藏
- AddressBookUI Framework in iOS9 beta4
- UI014---常用的三种动画
- CSS3 Media Queries
- 让动画动起来
- POJ 2524 Ubiquitous Religions 详细题解(并查集)
- Android新线程中更新主线程UI中的View方法汇总
- confluence搭建
- UI013---ImageView添加控件及tag说明