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): 1360    Accepted Submission(s): 672
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   |   We have carefully selected several similar problems for you:  1502 1501 1227 1080 1158  

---

 

　　 这是第二次坑在这道题上了，试验了好几种思路不就是运行时错误就是WA，最后火了还是看了别人的博客才做出来。

　　思路很简单，在LCS的基础之上加上路径记录。生成dp数组的时候做上标记，之后按顺序输出结果字符串。

　　我坑就坑在我没有想到好的记录路径的方法，还是高手的方法精炼，准确又简单。

　　下面是代码，注意数组的初始化。

 

 #include <iostream>
 #include <string.h>
 using namespace std;
 int dp[][];
 int f[][];
 char a[],b[];
 int l1,l2;
 int Length(char a[])    //返回一字符串长度
 {
     int i;
     for(i=;a[i]!='\0';i++);
     return i;
 }
 void lcs_pre(char a[],char b[])    //进行标记
 {
     l1 = Length(a);
     l2 = Length(b);
     for(int i=;i<=l1;i++){
         dp[i][] = ;
         f[i][] = ;
     }
     for(int i=;i<=l2;i++){
         dp[][i] = ;
         f[][i] = ;
     }
     for(int i=;i<=l1;i++)
         for(int j=;j<=l2;j++){
             if( a[i-]==b[j-] ){
                 dp[i][j] = dp[i-][j-] + ;
                 f[i][j] = ;
             }
             else if( dp[i][j-]>=dp[i-][j] ){
                 dp[i][j] = dp[i][j-];
                 f[i][j] = ;
             }
             else{
                 dp[i][j] = dp[i-][j];
                 f[i][j] = ;
             }
         }
 }
 void Print(int x,int y)    //输出结果字符串
 {
     if(x== && y==)
         return ;
     switch(f[x][y]){
         case :
             Print(x,y-);
             cout<<b[y-];
             break;
         case :
             Print(x-,y-);
             cout<<a[x-];
             break;
         case :
             Print(x-,y);
             cout<<a[x-];
             break;
         default:break;
     }
     return ;
 }
 int main()
 {
     while(cin>>a>>b){
         l1 = Length(a);
         l2 = Length(b);
         lcs_pre(a,b);    //进行标记
         Print(l1,l2);
         cout<<endl;
     }
     return ;
 }

Freecode : www.cnblogs.com/yym2013