hdu-1503 Advanced Fruits（LCS）

Advanced Fruits

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6597 Accepted Submission(s): 3459
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

题意

给定两个字符串，要把它们组合在一起，组合后的字符串相对顺序不变，而且在组成的字符串种可以找到原来两个字符串，字母可以错开，但是相对顺序不能变化，要这个组成的字符串中字母数最少，并输出这个字符串。

分析

找出最长公共子序列，记录下该路径，输出找的过程经过的路径。

代码

#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()
{
    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 Print(int i,int j)
{
    if(!i && !j)
    return ;
    if(mark[i][j]==0)
    {
        Print(i-1,j-1);
        printf("%c",s1[i-1]);
    }
    else if(mark[i][j]==1)//根据回溯的位置进行输出
    {
        Print(i-1,j);
        printf("%c",s1[i-1]);
    }
    else
    {
        Print(i,j-1);
        printf("%c",s2[j-1]);
    }
}
 
int main()
{
	//freopen("data.txt","r",stdin);
    while(~scanf("%s%s",s1,s2))
    {
        len1 = strlen(s1);
        len2 = strlen(s2);
        LCS();
        Print(len1,len2);
        printf("\n");
    }
 
    return 0;
}