poj 2250 Compromise 【lcs+路径还原】

题目链接：http://poj.org/problem?id=2250

                                                       

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9755		Accepted: 4131		Special Judge

In a few months the European Currency Union will become a reality. However, to join the club, the Maastricht criteria must be fulfilled, and this is not a trivial task for the countries (maybe except for Luxembourg). To enforce that Germany will fulfill the criteria, our government has so many wonderful options (raise taxes, sell stocks, revalue the gold reserves,...) that it is really hard to choose what to do. 

Therefore the German government requires a program for the following task: 
Two politicians each enter their proposal of what to do. The computer then outputs the longest common subsequence of words that occurs in both proposals. As you can see, this is a totally fair compromise (after all, a common sequence of words is something what both people have in mind). 

Your country needs this program, so your job is to write it for us.

Input

The input will contain several test cases. 
Each test case consists of two texts. Each text is given as a sequence of lower-case words, separated by whitespace, but with no punctuation. Words will be less than 30 characters long. Both texts will contain less than 100 words and will be terminated by a line containing a single '#'. 
Input is terminated by end of file.

Output

For each test case, print the longest common subsequence of words occuring in the two texts. If there is more than one such sequence, any one is acceptable. Separate the words by one blank. After the last word, output a newline character.

Sample Input

die einkommen der landwirte
sind fuer die abgeordneten ein buch mit sieben siegeln
um dem abzuhelfen
muessen dringend alle subventionsgesetze verbessert werden
#
die steuern auf vermoegen und einkommen
sollten nach meinung der abgeordneten
nachdruecklich erhoben werden
dazu muessen die kontrollbefugnisse der finanzbehoerden
dringend verbessert werden
#

Sample Output

die einkommen der abgeordneten muessen dringend verbessert werden

这道题让求相同的单词，并打印出来。和我们之前求一串字符中相同字符类似！ 

思路：我是通过dfs回溯来打印路径的，路径还原需要找dp增加的时候来自的方向，只有单词相等时才算是真正路径，不相等时只是为了更新这个dp值，开始为下一次相等做准备。

#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int vis[100][100];  //记录路径 
int dp[100][100];
string a[100];
string b[100];
string s;
void dfs(int len1,int len2)
{
	if(len1==0||len2==0) 
	  return;   //递归结束
	if(vis[len1][len2]==0)
	{
		dfs(len1-1,len2-1);
		cout<<a[len1-1]<<" ";
	 }
	else if(vis[len1][len2]==1)
	    dfs(len1,len2-1);
	else if(vis[len1][len2]==-1)
	    dfs(len1-1,len2);
}
int main()
{
	while(cin>>a[1])
	{   
	   
	    memset(vis,0,sizeof(vis));
	    memset(dp,0,sizeof(dp));
		int len1=2;
		int len2=1;
		while(cin>>s)
		{
			if(s=="#")  break;
			a[len1++]=s;
		}
		while(cin>>s)
		{
			if(s=="#")  break;
			b[len2++]=s;
		}
		for(int i=1;i<=len1;i++)
		{
			for(int j=1;j<=len2;j++)
			{
				if(a[i-1]==b[j-1])
				{
					dp[i][j]=dp[i-1][j-1]+1;
					vis[i][j]=0;       //从左上来的 
				}
				else if(dp[i][j-1]>dp[i-1][j])
				{
					dp[i][j]=dp[i][j-1];
					vis[i][j]=1;    //从上面来的 
				}
				else
				{
					dp[i][j]=dp[i-1][j];
					vis[i][j]=-1;  //从左边来的 
				 } 
			}
		}
		dfs(len1,len2);   //输出 
		cout<<endl;
	}
	return 0;
}