POJ 2250 （LCS，经典输出LCS序列 dfs）

题目链接：

http://poj.org/problem?id=2250

Compromise

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9284		Accepted: 3972		Special Judge

Description

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

Source

Ulm Local 1997

分析：

经典的LCS问题，重点是采用DFS输出此LCS序列中的一个

注意输入两个序列的方式，学习了

注意输入序列的下标从1开始

注意DFS要先递归到最后再输出序列

注意dp的初始化，直接memset就可以

代码如下：

代码如下;

#include<cstring>
#include<cstdio>
#include<string>
#include<iostream>
#include<algorithm>
#define max_v 1005
using namespace std;
string x[max_v],y[max_v];
int dp[max_v][max_v];
int l1,l2;
int dfs(int i,int j)
{if(i==0||j==0)return 0 ;if(x[i]==y[j])//来自左上角
    {dfs(i-1,j-1);cout<<x[i]<<" ";//先递归到最后再输出，，这样就是顺序的
    }else{if(dp[i-1][j]>dp[i][j-1])//来自上面
        {dfs(i-1,j);}else//来自左边
        {dfs(i,j-1);}}return 0;
}
int main()
{string s;while(cin>>s){l1=l2=0;if(s!="#"){x[++l1]=s;while(cin>>s&&s!="#"){x[++l1]=s;}}while(cin>>s&&s!="#"){y[++l2]=s;}memset(dp,0,sizeof(dp));for(int i=1; i<=l1; i++){for(int j=1; j<=l2; j++){if(x[i]==y[j]){dp[i][j]=dp[i-1][j-1]+1;}else{dp[i][j]=max(dp[i-1][j],dp[i][j-1]);}}}dfs(l1,l2);cout<<endl;}return 0;
}

转载于:https://www.cnblogs.com/yinbiao/p/9067766.html

POJ 2250 （LCS，经典输出LCS序列 dfs）相关推荐

[算法]LCS及输出LCS
最长公共子序列 https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1006 #include<bits/stdc++. ...
POJ 1159 - Palindrome 优化空间LCS
将原串和其逆序串的最长公共子序列求出来为M..那么2*n-M就是所需要加的最少字符..因为求出的M就是指的原串中"潜伏"的最长回文.. 问题转化为求LCS..但是n最大到5000. ...
【POJ - 2676】Sudoku （经典深搜，dfs数独）
题干: Sudoku is a very simple task. A square table with 9 rows and 9 columns is divided to 9 smaller s ...
POJ 1458 Common Subsequence DP LCS 最长公共子序列
最长公共子序列,照抄<算法设计与分析导论>P138-140 设输入的两个字符串分别为a1,a2,```,am(串a) b1,b2,````,bn(串b) 设d(i,j)为字符串a1,a2, ...
动态规划---实现输出最大公共子序列的长度以及输出最大子字符串（java语言描述）
参考博客地址:http://blog.csdn.NET/biangren/article/details/8038605 http://blog.csdn.net/njr465167967/artic ...
POJ 1088 滑雪（输出对比）
http://poj.org/problem?id=1088 滑雪 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 68159 ...
c语言输出法雷序列,法雷（法里）序列 - osc_h0wb1wlt的个人空间 - OSCHINA - 中文开源技术交流社区...
定义: 对任意给定的一个自然数n,将分母小于等于n的不可约的真分数按升序排列,并且在第一个分数之前加上0/1,在最后一个分数之后加上1/1,这个序列称为n级法雷数列,即法雷数列是0和1之间最简分数升序 ...
POJ 1691 - Painting A Board + Python （DFS）
题目链接:1691 -- Painting A Board 参考资料:POJ 1691 - Painting A Board | 眈眈探求特别注意:注意本文的升序排列语句. 一题目描述: 给定一个 ...

POJ 2250 （LCS，经典输出LCS序列 dfs）

POJ 2250 （LCS，经典输出LCS序列 dfs）相关推荐

最新文章

热门文章