最长公共子序列 POJ 2250
来源:互联网 发布:黑帽seo零基础学习 编辑:程序博客网 时间:2024/05/22 00:11
Compromise
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3300 Accepted: 1542 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
- 最长公共子序列 POJ 2250
- poj 2250 最长公共子序列
- 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 (最长公共子序列LCS)
- POJ 1458 最长公共子序列
- POJ 1458 最长公共子序列
- POJ 1458 最长公共子序列
- poj 1458 最长公共子序列
- poj 1458 最长公共子序列
- poj Common Subsequence 最长公共子序列
- LAMP兄弟连原创Linux视频教程-第2讲Linux系统安装[免费下载]
- Warning: Missing argument 2问题
- tomcat 6.X weblogic 10.X
- 表空间对用户的管理
- The constraint also helps speed up the query.
- 最长公共子序列 POJ 2250
- vs 2008 快捷键
- 2010-11-29 情况
- Wince程序内存和存储内存
- 解惑Spring嵌套事务
- 角点检测(Corner Detection) cvFindCornerSubPix 使用范例
- 深入Java核心 Java内存分配原理精讲(网络转载)
- 如何取得Android源代码
- How to create simple and advanced pivot tables in C# and ASP.NET