zoukankan      html  css  js  c++  java
  • 最长公共子序列(LCS) Medium1

    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.

    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.

    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 landwirte
    sind fuer die abgeordneten ein buch mit sieben siegeln
    um dem abzuhelfen
    muessen dringend alle subventionsgesetze verbessert werden
    #
    die steuern auf vermoegen und einkommen
    sollten nach meinung der abgeordneten
    nachdruecklich erhoben werden
    dazu muessen die kontrollbefugnisse der finanzbehoerden
    dringend verbessert werden
    #
    

    Sample Output

    die einkommen der abgeordneten muessen dringend verbessert werden
    #include<iostream>
    #include<cstring>
    #include<cstdio>
    #include<string>
    #include<map>
    
    using namespace std;
    const int N = 200 + 5;
    int dp[N][N], Mark[N][N];
    char ch[50];
    string a[N], b[N];
    void Work(int len_1, int len_2){
        memset(Mark, 0, sizeof(Mark));
        memset(dp, 0, sizeof(dp));
        for(int i = 1; i <= len_1; i++)
            for(int j = 1; j <= len_2; j++)
                if(a[i] == b[j]){ dp[i][j] = dp[i-1][j-1] + 1; Mark[i][j] = 1;}
                else if(dp[i-1][j] >= dp[i][j-1]) {dp[i][j] = dp[i-1][j]; Mark[i][j] = 2;}
                else dp[i][j] = dp[i][j-1],Mark[i][j] = 3;
    }
    bool flag;
    void Solve(int i, int j){
        if(i == 0 || j == 0) return;
        if(Mark[i][j] == 1){
            Solve(i-1, j-1);
            if(flag) printf(" ");
            flag = true;
            printf("%s",a[i].c_str());
        }else if(Mark[i][j] == 2){
            Solve(i-1, j);
        }else if(Mark[i][j] == 3)
            Solve(i, j - 1);
    }
    int main(){
        while(cin >> ch){
            int len_1 = 1,len_2 = 1;
            flag = false;
            a[len_1++] = ch;
            while(cin >> ch &&ch[0] != '#'){
                a[len_1++] = ch;
            }
            while(cin >> ch && ch[0] != '#'){
                b[len_2++] = ch;
            }
            Work(len_1, len_2);
            Solve(len_1, len_2);
            printf("
    ");
        }
    }
  • 相关阅读:
    idea2021.2安装后不能打开如何解决?(附无限试用方法)
    Linux驱动实践:一起来梳理中断的前世今生(附代码)
    Linux驱动实践:带你一步一步编译内核驱动程序
    Linux驱动实践:驱动程序如何发送【信号】给应用程序?
    Linux驱动实践:如何编写【 GPIO 】设备的驱动程序?
    Linux驱动实践:你知道【字符设备驱动程序】的两种写法吗?
    【无源物联网】物联网的下一个风口?
    分辨率并不是越高越好,因为人眼分辨能力存在极限
    如何判断一个哈希函数的好坏
    常用设计模式单例模式
  • 原文地址:https://www.cnblogs.com/Pretty9/p/7406895.html
Copyright © 2011-2022 走看看