Poj2250: compromise (LCS)

Source: Internet
Author: User


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 failed t for Luxembourg ). to enforce
That Germany will fulfill the criteria, our Government has so far wonderful options (raise taxes, destination 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.


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
Line containing a single '#'.
Input is terminated by end of file.


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

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
Question: give two paragraphs to find the longest public word string.
Idea: For the LCS problem, you only need to set a two-dimensional record.
#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;}

Related Keywords:

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.