hdu1503Advanced Fruits（动态规划之公共最长子序列+回溯路径）

àì夳堔傛蜴生んèń 2022-08-21 10:59 23阅读 0赞

# Advanced Fruits #

**Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)  
Total Submission(s): 2485    Accepted Submission(s): 1262  
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<queue>
    #include<iostream>
    using namespace std;
    char a[10000],b[10000];
    int m,n,dp[1005][1005],mark[1000][1000];//mark最标记由什么地方来的。
    void huisu(int i,int j)
    {
        if(i==0&&j==0)
            return ;
        if(mark[i][j]==0)
        {
            huisu(i-1,j-1);
            printf("%c",a[i-1]);
        }
        else if(mark[i][j]==-1)//说明由上面来的。
        {
            huisu(i,j-1);
            printf("%c",b[j-1]);
        }
        else
        {
             huisu(i-1,j);
             printf("%c",a[i-1]);
        }
    }
    int main()
    {
        int i,j;
        int m,n;
        while(~scanf("%s %s",a,b))
        {
             m=strlen(a);
             n=strlen(b);
             memset(dp,0,sizeof(dp));
             for(i=0;i<=n;i++)
                mark[0][i]=-1;
             for(i=0;i<=m;i++)
                mark[i][0]=1;
             for(i=1;i<=m;i++)
             {
                 for(j=1;j<=n;j++)
                 {
                     if(a[i-1]==b[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;
                        }
                 }
             }
             huisu(m,n);
             printf("\n");
        }
        return 0;
    }