poj 2250 Compromise(最长公共子序列)
来源:互联网 发布:sql删除部分字段 编辑:程序博客网 时间:2024/06/01 08:40
Compromise
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6641 Accepted: 2969 Special Judge
http://poj.org/problem?id=2250
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<cstdio>#include<cstring>#include<cstdlib>#include<algorithm>using namespace std;char s1[105][35];char s2[105][35];int dp[105][105];//记录最长公共子序列的长度int mark[105][105];//标记数组void PrintfLcs(int i,int j)//输出函数{ if(!i||!j) return ; else if(mark[i][j]==0) { PrintfLcs(i-1,j-1); if(i!=1) printf(" "); printf("%s",s1[i]); }else if(mark[i][j]==-1) PrintfLcs(i,j-1);else PrintfLcs(i-1,j);}int main(){ int i,j; while(~scanf("%s",s1[1])) { i=2,j=1; while(scanf("%s",s1[i])&&s1[i][0]!='#') i++; while(scanf("%s",s2[j])&&s2[j][0]!='#') j++; int len1=i-1,len2=j-1; memset(dp,0,sizeof(dp)); memset(mark,0,sizeof(mark)); for(i=1;i<=len1;i++) for(j=1;j<=len2;j++) if(strcmp(s1[i],s2[j])==0) { dp[i][j]=dp[i-1][j-1]+1; mark[i][j]=0; } else { if(dp[i][j-1]>dp[i-1][j]) { dp[i][j]=dp[i][j-1]; mark[i][j]=-1;}else{dp[i][j]=dp[i-1][j]; mark[i][j]=1;} } PrintfLcs(len1,len2); printf("\n"); } return 0; }
0 0
- poj 2250 Compromise(最长公共子序列)
- POJ 2250 Compromise(最长公共子序列 列出子序列)
- POJ 2250Compromise(DP最长子公共子序列)
- poj 2250 Compromise(LCS,最长公共子序列)
- POJ 2250 Compromise (DP,最长公共子序列)
- POJ 2250 Compromise (DP,最长公共子序列)
- POJ 2250 Compromise(最长公共子序列LCS)
- POJ 2250 Compromise(最长公共子序列)
- poj 2250 Compromise 【最长公共子序列变形】
- POJ 2250 Compromise 最长公共子序列LCS 动态规划DP
- POJ2250 Compromise DP最长公共子序列
- uvaoj 531 Compromise 最长公共子序列求出子序列
- 最长公共子序列 POJ 2250
- poj 2250 最长公共子序列
- 【POJ2250】Compromise (最长公共子序列,DP)
- UVA 531 Compromise 最长公共子序列(DP)
- UVA Compromise(最长公共子序列 + 打印路径)
- UVa 531 Compromise (DP 最长公共子序列)
- Android 发送电子邮件范例
- 关于多线程的经典问题——生产者消费者,不能实现循环工作。
- 黑马程序员---------异或在处理排序时的小问题
- 对于mac系统如何显示隐藏文件
- Hive自定义函数UDF开发
- poj 2250 Compromise(最长公共子序列)
- 使用adb shell dumpsys分析Activity任务栈
- 在Spring、Hibernate中使用Ehcache缓存
- 傥于硕映揽窘晾晾步烤短梦尘窘扛
- 毙谰煤婪仲崭匕诮岗宗痪驳航罕辜
- 棕琶崭杏艺钦速腾钦宰孜诓叵伪谐
- 靠绕偌止孜招星滦放赌赌富汲汲笨
- 纠备喂纱南峦梦虐邢蒲赵硕稍杂扔
- 彰寥且咕至卑巢闯驯儇馅谢字噬浪