Advanced Fruits hd 1503
来源:互联网 发布:python配置文件怎么写 编辑:程序博客网 时间:2024/05/17 08:07
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.
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
pearch
题意:给你两个字符串 把公共部分去掉剩余的连在一起
思路 :LCS 这道题WA了好多次,一直超时。。晕 后来看了一眼网上的代码才明白
#include <stdio.h> #include <string.h> #include <algorithm> using namespace std; char s1[1000],s2[1000]; int len1,len2,dp[1000][1000],mark[1000][1000]; void LCS() //LCS核心 { int i,j; memset(dp,0,sizeof(dp)); for(i = 0;i<=len1;i++) mark[i][0] = 1; for(i = 0;i<=len2;i++) mark[0][i] = -1; for(i = 1; i<=len1; i++) { for(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 PrintLCS(int i,int j) //输出公共字符串部分 { if(!i && !j) return ; if(mark[i][j]==0) { PrintLCS(i-1,j-1); printf("%c",s1[i-1]); } else if(mark[i][j]==1) { PrintLCS(i-1,j); printf("%c",s1[i-1]); } else { PrintLCS(i,j-1); printf("%c",s2[j-1]); } } int main() { while(scanf("%s%s",s1,s2)!=EOF) { len1 = strlen(s1); len2 = strlen(s2); LCS(); PrintLCS(len1,len2); printf("\n"); } return 0; }
0 0
- Advanced Fruits hd 1503
- 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
- HDU 1503 Advanced Fruits
- hdu 1503 Advanced Fruits
- HDOJ--1503 Advanced Fruits
- hdu 1503 Advanced Fruits
- HDOJ-1503-Advanced Fruits
- hdu 1503 Advanced fruits
- HDOJ-1503 Advanced Fruits
- HDU 1503 Advanced Fruits
- hdu 1503 Advanced Fruits
- 【POJ】Jungle Roads
- HDU1596 find the safest road(floyd)
- 想成为嵌入式程序员应知道的0x10个基本问题
- Java中可变长参数的使用及注意事项
- SQL内连接、左外链接、右外连接、交叉链接区别
- Advanced Fruits hd 1503
- "Mac OS X"想要进行更改。键入管理员的名称和密码以允许执行此操作("Mac OS X"想使用系统钥匙串)
- hdu 5823color II 状压(2016多校第八场1003)
- 【POJ】Stockbroker Grapevine
- linux 下 mysql自动备份脚本
- Android studio 删除所有注释
- 【NOIP2012模拟11.8】斐波那契
- 几个小问题。
- 【HDU 3072】【JZOJ 4686】 通讯