hdu 1503 Advanced Fruits（最长公共子序列）

Advanced Fruits

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

 const int maxn=;

 char str1[maxn],str2[maxn];
 int dp[maxn][maxn],len; //len指示ans的长度

 struct node{
     int i,j;    //i记录主串位置，j记录副串当前字符位置
     char ch;        //记录当前字符
 }ans[maxn];

 int max(int a,int b){
     return a>b?a:b;
 }

 void LCS(int m,int n){
     memset(dp,,sizeof(dp));
     int i,j;
     for(i=;i<=m;i++)
         for(j=;j<=n;j++)
             if(str1[i]==str2[j])
                 dp[i][j]=dp[i-][j-]+;
             else
                 dp[i][j]=max(dp[i-][j],dp[i][j-]);
     if(dp[m][n]==){    //如果没有公共序列，直接输出
         printf("%s%s",str1,str2);
     }else{
         i=m;j=n;
         len=;
         while(i!= && j!=){    //取出最长公共子序列的字母
             if((dp[i][j]==dp[i-][j-]+) && str1[i]==str2[j]){
                 ans[len].i=i;
                 ans[len].j=j;
                 ans[len++].ch=str1[i];      //倒序保存最长公共子序列字母
                 i--;j--;
             }else if(dp[i-][j]>dp[i][j-])
                 i--;
             else
                 j--;
         }
     }
 }

 int main(){

     //freopen("input.txt","r",stdin);

     int len1,len2,i,j,k;
     while(scanf("%s%s",str1+,str2+)!=EOF){
         len1=strlen(str1+);
         len2=strlen(str2+);
         LCS(len1,len2);
         i=j=;
         for(k=len-;k>=;k--){
             while(i!=ans[k].i){
                 printf("%c",str1[i]);
                 i++;
             }
             while(j!=ans[k].j){
                 printf("%c",str2[j]);
                 j++;
             }
             printf("%c",ans[k].ch);
             i++;j++;
         }
         printf("%s%s\n",str1++ans[].i,str2++ans[].j);
     }
     return ;
 }

根据LCS的原理，将每个字符都进行标记，看两个字符串中对应的字符究竟处于什么状态，然后输出，其标记为公共子串的字符只输出一次即可

 #include <stdio.h>
 #include <string.h>
 #include <algorithm>
 using namespace std;

 char s1[],s2[];
 int len1,len2,dp[][],mark[][];

 void LCS()
 {
     int i,j;
     memset(dp,,sizeof(dp));
     for(i = ;i<=len1;i++)
     mark[i][] = ;
     for(i = ;i<=len2;i++)
     mark[][i] = -;
     for(i = ; i<=len1; i++)
     {
         for(j = ; j<=len2; j++)
         {
             if(s1[i-]==s2[j-])
             {
                 dp[i][j] = dp[i-][j-]+;
                 mark[i][j] = ;
             }
             else if(dp[i-][j]>=dp[i][j-])
             {
                 dp[i][j] = dp[i-][j];
                 mark[i][j] = ;
             }
             else
             {
                 dp[i][j] = dp[i][j-];
                 mark[i][j] = -;
             }
         }
     }
 }

 void PrintLCS(int i,int j)
 {
     if(!i && !j)
     return ;
     if(mark[i][j]==)
     {
         PrintLCS(i-,j-);
         printf("%c",s1[i-]);
     }
     else if(mark[i][j]==)//根据回溯的位置进行输出
     {
         PrintLCS(i-,j);
         printf("%c",s1[i-]);
     }
     else
     {
         PrintLCS(i,j-);
         printf("%c",s2[j-]);
     }
 }

 int main()
 {
     while(~scanf("%s%s",s1,s2))
     {
         len1 = strlen(s1);
         len2 = strlen(s2);
         LCS();
         PrintLCS(len1,len2);
         printf("\n");
     }

     return ;
 }