poj2250 Compromise dp lcs 记录路径
来源:互联网 发布:链家端口费 编辑:程序博客网 时间:2024/04/19 23:08
Compromise
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5045 Accepted: 2297 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.
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.
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 landwirtesind fuer die abgeordneten ein buch mit sieben siegelnum dem abzuhelfenmuessen dringend alle subventionsgesetze verbessert werden#die steuern auf vermoegen und einkommensollten nach meinung der abgeordnetennachdruecklich erhoben werdendazu muessen die kontrollbefugnisse der finanzbehoerdendringend verbessert werden#
Sample Output
die einkommen der abgeordneten muessen dringend verbessert werden
Source
Ulm Local 1997
#include<iostream>#include<cstdlib>#include<string>#include<memory.h>using namespace std;string a[110];string b[110];string c[110];int dp[110][110];int d[110][110];int main(){ int l1,l2; while(cin>>a[1]) { l1=2; while(a[l1-1]!="#") cin>>a[l1++]; l1-=2; cin>>b[1]; l2=2; while(b[l2-1]!="#") cin>>b[l2++]; memset(dp,0,sizeof(dp)); memset(d,0,sizeof(d)); for(int i=1;i<=l1;i++) for(int j=1;j<=l2;j++) { if(a[i]==b[j]) dp[i][j]=dp[i-1][j-1]+1,d[i][j]=3; else { if(dp[i-1][j]>dp[i][j-1]) dp[i][j]=dp[i-1][j],d[i][j]=2; else dp[i][j]=dp[i][j-1],d[i][j]=1; } } int n=dp[l1][l2]; int i=l1; int j=l2; while(n) { while(d[i][j]!=3) { if(d[i][j]==2) i--; else j--; } n--; c[n]=a[i]; i--;j--; } cout<<c[0]; for(int k=1;k<dp[l1][l2];k++) cout<<" "<<c[k]; cout<<endl; }}
- poj2250 Compromise dp lcs 记录路径
- POJ2250:Compromise(LCS)
- POJ2250:Compromise(LCS)
- POJ2250 Compromise (LCS)
- POJ2250 Compromise (LCS)
- POJ2250 Compromise,map、dp
- POJ2250 Compromise(dp)
- poj 2250 Compromise (DP-LCS 记录路径)
- POJ2250---Compromise(dp,最长公共子序列,输出路径)
- POJ2264---Advanced Fruits(dp,LCS变着花样记录路径,POJ2250的升级版)
- UVA 531 - Compromise(dp + LCS打印路径)
- poj 2250 Compromise dp lcs 路径输出
- POJ 2250--Compromise(LCS以及路径记录)
- poj 2250 Compromise 记录路径的lcs
- poj2250-打印单一LCS路径。
- POJ2250 Compromise DP最长公共子序列
- poj2250 - Compromise
- POJ 2250 Compromise (线性dp LCS +递归路径)
- oracle用户解锁的三种方式
- Highcharts纯Javascript图表使用讲解(附Demo全源码案例)
- JS获取时间显示上午,下午
- 与moment.js整合使用的javascript日期选择期 - Pikaday
- C++头文件
- poj2250 Compromise dp lcs 记录路径
- 大平台的局限
- C++11(及现代C++风格)和快速迭代式开发
- 项目中软件架构过程
- 为Android系统安装BusyBox
- .NET Remoting程序开发入门篇
- MongoDB结构划分
- 排列组合算法的递归实现
- Common Tasks :Connecting to a Specified Host