POJ2250:Compromise(LCS)
来源:互联网 发布:身份证复印app软件 编辑:程序博客网 时间:2024/04/28 08:35
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
题意:给出两段文字,求出最长的公共单词串
思路:LCS问题,只需要开个二维来记录就好了
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;char a[35][105],b[35][105],c[35][105];int dp[105][105],mark[105][105],len1,len2,cnt;void LCS(){ int i,j; memset(dp,0,sizeof(dp)); memset(mark,0,sizeof(mark)); for(i = 0;i<=len1;i++) mark[i][0] = 1; for(i = 0;i<=len2;i++) mark[0][i] = -1; for(i = 1; i<=len1; i++) { for(j = 1; j<=len2; j++) { if(!strcmp(a[i-1],b[j-1])) { dp[i][j] = dp[i-1][j-1]+1; mark[i][j] = 0; } else if(dp[i-1][j]>=dp[i][j-1]) { dp[i][j] = dp[i-1][j]; mark[i][j] = 1; } else { dp[i][j] = dp[i][j-1]; mark[i][j] = -1; } } }}void PrintLCS(int i,int j){ if(!i&&!j) return ; if(mark[i][j]==0) { PrintLCS(i-1,j-1); strcpy(c[cnt++],a[i-1]); } else if(mark[i][j]==1) { PrintLCS(i-1,j); } else { PrintLCS(i,j-1); }}int main(){ int i; while(~scanf("%s",a[0])) { len1 = 1; while(strcmp(a[len1-1],"#")) scanf("%s",a[len1++]); len1-=1; scanf("%s",b[0]); len2 = 1; while(strcmp(b[len2-1],"#")) scanf("%s",b[len2++]); LCS(); cnt = 0; PrintLCS(len1,len2); printf("%s",c[0]); for(i = 1; i<cnt; i++) { printf(" %s",c[i]); } printf("\n"); } return 0;}
- POJ2250:Compromise(LCS)
- POJ2250:Compromise(LCS)
- POJ2250 Compromise (LCS)
- POJ2250 Compromise (LCS)
- poj2250 Compromise dp lcs 记录路径
- poj2250 - Compromise
- POJ2250 Compromise,map、dp
- POJ2250——Compromise
- POJ2250 Compromise(dp)
- POJ2250(compromise) 解题报告
- poj2250-打印单一LCS路径。
- POJ2250 Compromise DP最长公共子序列
- pku 2250 Compromise(LCS)
- [LCS]Uva531 Compromise
- 【POJ2250】Compromise (最长公共子序列,DP)
- POJ2250 & UVA 531 Compromise(字符串、 最长公共子序列)
- POJ2250---Compromise(dp,最长公共子序列,输出路径)
- uva531 - Compromise(动规,lcs)
- hdu 3853 LOOPS
- centos 怎么安装 g++
- Linux学习必备程序
- UNDO表空间
- JS正则表达式验证数字
- POJ2250:Compromise(LCS)
- Android 应用程序之间内容分享 当不存在能够分享的程序 [整理]
- ASIHTTPRequest使用过程中遇到的问题及解决办法
- 业务处理流程及配置过程小结
- ASP.NET网络映射驱动器无权限访问的解决方案
- MongoDB学习笔记(一) MongoDB介绍及安装
- ssh批量登录并执行命令(python实现)
- android jni 移动妹妹计费 cocos2dx
- objective-C 实现单例模式