LCS加强版+输出路径(1503)

Advanced Fruits

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

pre数组用于输出路径，0，-1，1三个值分别代表三种状态转移。首先求出LCS，并标记出转移方向。最后需要输出路径：如果相等跳两个输出一个即可；如果横向大，则输出纵向，跳一个；纵向同理。即可得到所求。这个过程很有利于深入理解LCS。

/*------------------Header Files------------------*/
#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <ctype.h>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <vector>
#include <limits.h>
using namespace std;
/*------------------Definitions-------------------*/
#define LL long long
#define PI acos(-1.0)
#define INF 0x3F3F3F3F
#define MOD 10E9+7
#define MAX 500050
/*---------------------Work-----------------------*/
char a[150],b[150];
int pre[150][150],dp[150][150];
void print(int x,int y)
{
	if(x==0&&y==0) return ;
	if(pre[x][y]==0)
	{
		print(x-1,y-1);
		printf("%c",a[x]);
	}
	else if(pre[x][y]==1)
	{
		print(x-1,y);
		printf("%c",a[x]);
	}
	else if(pre[x][y]==-1)
	{
		print(x,y-1);
		printf("%c",b[y]);
	}
}
void work()
{
	while(~scanf("%s%s",a+1,b+1)) //下标从1开始,~没加OLE一次 
	{
		int lena=strlen(a+1),lenb=strlen(b+1);
		//方向初始化 
		for(int i=0;i<=lena;i++) pre[i][0]=1;
		for(int i=0;i<=lenb;i++) pre[0][i]=-1;
		memset(dp,0,sizeof(dp));
		for(int i=1;i<=lena;i++)
			for(int j=1;j<=lenb;j++)
			{
				if(a[i]==b[j])
				{
					dp[i][j]=dp[i-1][j-1]+1;
					pre[i][j]=0;
				}
				else if(dp[i-1][j]>dp[i][j-1])
				{
					dp[i][j]=dp[i-1][j];
					pre[i][j]=1;
				}
				else
				{
					dp[i][j]=dp[i][j-1];
					pre[i][j]=-1;
				}
			}
		print(lena,lenb);
		printf("\n");
	}
}
/*------------------Main Function------------------*/
int main()
{
	//freopen("test.txt","r",stdin);
	//freopen("cowtour.out","w",stdout);
	//freopen("cowtour.in","r",stdin);
	work();
	return 0;
}