HDU-1503 Advanced Fruits（DP LCS）

Advanced Fruits

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3647    Accepted Submission(s): 1888
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 peachananas bananapear peach

 

Sample Output

appleachbananaspearch

 

Source

University of Ulm Local Contest 1999

 

 

看了样例还以为是找最近的一个相同的字母然后剪切后合在一起就好了……

找出LCS然后标记，是LCS的一部分就输出一次就行了。比较简单但是是做的第一个LCS的问题！

#include<cstdio>#include<algorithm>#include<string.h>#include<iostream>#include <cstring>#include<cmath>#include <map>#include<queue>#define PI acos(-1.0)#define LL long long#define INF 0x3f3f3f3f#define MAXN 100+10using namespace std;char a[MAXN],b[MAXN];int dp[MAXN][MAXN],mark[MAXN][MAXN];void Print(int len1,int len2){    if(!len1 && !len2)  return;    if(mark[len1][len2]==3) {Print(len1-1,len2-1); printf("%c",a[len1]);}    else    if(mark[len1][len2]==1) {Print(len1-1,len2); printf("%c",a[len1]);}    else    {Print(len1,len2-1); printf("%c",b[len2]);}}int main(void){    int len1,len2;    while(~scanf("%s%s",a+1,b+1))    {        len1 = strlen(a+1);        len2 = strlen(b+1);        memset(mark,0,sizeof mark);        for(int i = 1; i <= len1; ++i)            mark[i][0] = 1;        for(int i = 1; i <= len2; ++i)            mark[0][i] = 2;        for(int i = 1; i <= len1; ++i)        {            for(int j = 1; j <= len2; ++j)            {                if(a[i]==b[j])  {dp[i][j] = dp[i-1][j-1]+1; mark[i][j] = 3; }                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] = 2; }            }        }        Print(len1,len2);        printf("\n");    }    return 0;}