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

    The company "21st Century Fruits" has specialized in creating new sorts of fruits by transferring genes from one fruit into the genome of another one. Most times this method doesn't work, but sometimes, in very rare cases, a new fruit emerges that tastes like a mixture between both of them. 
    A big topic of discussion inside the company is "How should the new creations be called?" A mixture between an apple and a pear could be called an apple-pear, of course, but this doesn't sound very interesting. The boss finally decides to use the shortest string that contains both names of the original fruits as sub-strings as the new name. For instance, "applear" contains "apple" and "pear" (APPLEar and apPlEAR), and there is no shorter string that has the same property. 

    A combination of a cranberry and a boysenberry would therefore be called a "boysecranberry" or a "craboysenberry", for example. 

    Your job is to write a program that computes such a shortest name for a combination of two given fruits. Your algorithm should be efficient, otherwise it is unlikely that it will execute in the alloted time for long fruit names. 

    InputEach line of the input contains two strings that represent the names of the fruits that should be combined. All names have a maximum length of 100 and only consist of alphabetic characters. 

    Input is terminated by end of file. 
    OutputFor each test case, output the shortest name of the resulting fruit on one line. If more than one shortest name is possible, any one is acceptable. 
    Sample Input

    apple peach
    ananas banana
    pear peach

    Sample Output

    appleach
    bananas
    pearch
    #include<iostream>
    #include<cstring>
    #include<cstdio>
    
    using namespace std;
    const int N = 1000 + 5;
    char str1[N], str2[N];
    int dp[N][N], Mark[N][N];
    
    void Work(){
        memset(dp, 0, sizeof(dp));
    
        int len_1 = strlen(str1), len_2 = strlen(str2);
        for(int i = 0;i<=len_1;i++)   Mark[i][0] = 0;
        for(int i = 0;i<=len_2;i++)    Mark[0][i] = -1;
        for(int i = 1; i <= len_1; i++)
            for(int j = 1; j <= len_2; j++)
                if(str1[i-1] == str2[j-1]){ 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] = 0;}
                else dp[i][j] = dp[i][j-1],Mark[i][j] = -1;
    }
    void Solve(int i, int j){
        if(i == 0 && j == 0) return;
        if(Mark[i][j] > 0){
            Solve(i - 1, j - 1);
            printf("%c", str1[i-1]);
        }else if(Mark[i][j] == 0){
            Solve(i-1, j);
            printf("%c", str1[i-1]);
        }else{
            Solve(i, j-1);
            printf("%c", str2[j-1]);
        }
    }
    int main(){
        while(scanf("%s %s", str1, str2) == 2){
            Work();
            Solve(strlen(str1), strlen(str2));
            printf("
    ");
        }
    }
  • 相关阅读:
    光纤收发器的连接及收发器指示灯故障诊断
    Keepalive介绍及工作原理
    RabbitMQ消息队列集群配置-1
    python2 centos7 安装mysql-python库
    etcd服务的安装与配置 yum安装新版本
    ETCD集群安装配置及简单应用 老版本
    查看mysql 最大连接数,连接线程数
    TCP连接状态详解及TIME_WAIT过多的解决方法
    Linux 进程打开最大文件连接数Too many open files
    redis 连接数 修改
  • 原文地址:https://www.cnblogs.com/Pretty9/p/7406901.html
Copyright © 2011-2022 走看看