hdu1503 Advanced Fruits（动态规划 DP & 最长公共子序列（LCS）问题升级版）

题目大意

$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.
$中文解释$
给你两个字符串s1,s2，用最短的字符串表示它们。（公共子串只输出一次）

分析

根据LCS的原理，将每个字符都进行标记，看两个字符串中对应的字符究竟处于什么状态，然后输出，其标记为公共子串的字符只输出一次即可.
dp[i][j] : 第一个字符串的前 i 个 ，和第二个字符串的前 j 个最短组合的长度 。

这道题需要输出，所以比一般的LCS问题需要多一条记录路径。

• 第一种形式
  mark[i][j] : 第一个字符串的第 i 个 ，和第二个字符串的第 j 个字符的状态。

#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;//0 表示s1的第i-1个字符与s2的第j-1个字符是相等的。
            }
            else if(dp[i-1][j]>=dp[i][j-1])
            {
                dp[i][j] = dp[i-1][j];
                mark[i][j] = 1;//1 表示在比较s1的第i-1个字符和s2的第j-1个字符时，由s1的第i-1个字符而来
            }
            else
            {
                dp[i][j] = dp[i][j-1];
                mark[i][j] = -1;//
            }
        }
    }
}
 
void PrintLCS(int i,int j)
{
    if(!i && !j)
    return ;
    if(mark[i][j]==0)
    {
        PrintLCS(i-1,j-1);
        printf("%c",s1[i-1]);
    }
    else if(mark[i][j]==1)//根据回溯的位置进行输出
    {
        PrintLCS(i-1,j);
        printf("%c",s1[i-1]);
    }
    else
    {
        PrintLCS(i,j-1);
        printf("%c",s2[j-1]);
    }
}
 
int main()
{
    while(~scanf("%s%s",s1,s2))
    {
        len1 = strlen(s1);
        len2 = strlen(s2);
        LCS();
        PrintLCS(len1,len2);
        printf("\n");
    }
 
    return 0;
}

import java.io.IOException;
import java.util.Arrays;
import java.util.Scanner;

public class Main {
	
	public static void main(String[] args) throws IOException {
		Scanner in=new Scanner(System.in);

		int [][]dp=new int [110][110];
		int n;
		char path[]=new char [210];
		
		while(in.hasNext()) {
			Arrays.fill(path, '\0');
			char []s1=in.next().toCharArray();
			char []s2=in.next().toCharArray();
			int len1=s1.length;
			int len2=s2.length;
			for(int i=0;i<101;i++) {
				Arrays.fill(dp[i], 0);
			}
			for(int i=1;i<=len1;i++) {
				for(int j=1;j<=len2;j++) {
					if(s1[i-1]==s2[j-1]) {
						dp[i][j]=dp[i-1][j-1]+1;
					}else {
						dp[i][j]=Math.max(dp[i-1][j], dp[i][j-1]);
					}
				}
			}
			int t1=len1,t2=len2;
			int t=0;
			while(dp[t1][t2]>0) {//当t1或t2有一个到0时（即有一个率先被搜完），循环停止。
				if(s1[t1-1]==s2[t2-1]) {//字符串相等的话，公共字符串只输出一次，所以t1、t2同时减一
					path[t++]=s1[t1-1];
					t1--;t2--;
				}else {//不相等的话
					if(dp[t1-1][t2]>dp[t1][t2-1]) {//表示取s1.
						path[t++]=s1[t1-1];
						t1--;
					}else {
						path[t++]=s2[t2-1];
						t2--;
					}
				}
			}
			t1--;t2--;
			while(t1>=0) path[t++]=s1[t1--];
			while(t2>=0) path[t++]=s2[t2--];
			
			for(int i=t-1;i>=0;i--) System.out.print(path[i]);
			System.out.println();
		}
	}
}
/*
apple peach
ananas banana
pear peach

appleach
bananas
pearch
*/