zoukankan      html  css  js  c++  java
  • HDU1503(LCS,记录路径)

    Advanced Fruits

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 2231    Accepted Submission(s): 1139
    Special Judge


    Problem Description
    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. 
     
    Input
    Each 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. 
     
    Output
    For 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
     
    Source
     
     
    /*
    ID: LinKArftc
    PROG: 1503.cpp
    LANG: C++
    */
    
    #include <map>
    #include <set>
    #include <cmath>
    #include <stack>
    #include <queue>
    #include <vector>
    #include <cstdio>
    #include <string>
    #include <utility>
    #include <cstdlib>
    #include <cstring>
    #include <iostream>
    #include <algorithm>
    using namespace std;
    #define eps 1e-8
    #define randin srand((unsigned int)time(NULL))
    #define input freopen("input.txt","r",stdin)
    #define debug(s) cout << "s = " << s << endl;
    #define outstars cout << "*************" << endl;
    const double PI = acos(-1.0);
    const double e = exp(1.0);
    const int inf = 0x3f3f3f3f;
    const int INF = 0x7fffffff;
    typedef long long ll;
    
    const int maxn = 210;
    
    int dp[maxn][maxn];
    char str1[maxn], str2[maxn];
    bool vis1[maxn], vis2[maxn];
    
    int main() {
        //input;
        int len1, len2;
        while (~scanf("%s %s", str1, str2)) {
            len1 = strlen(str1);
            len2 = strlen(str2);
            for (int i = 1; i <= len1; i ++) {
                for (int j = 1; j <= len2; j ++) {
                    if (str1[i-1] == str2[j-1]) {
                        dp[i][j] = dp[i-1][j-1] + 1;
                    }
                    else dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
                }
            }
            memset(vis1, 0, sizeof(vis1));
            memset(vis2, 0, sizeof(vis2));
            if (dp[len1][len2] == 0) printf("%s%s
    ", str1, str2);
            else {
                int i = len1, j = len2;
                int cur = 0;
                while (i && j) {
                    if ((dp[i][j] == dp[i-1][j-1] + 1) && (str1[i-1] == str2[j-1])) {
                        i --; j --;
                        vis1[i] = true;
                        vis2[j] = true;
                    } else if (dp[i-1][j] > dp[i][j-1]) i --;
                    else j --;
                }
                i = 0; j = 0;
                while (1) {
                    while (!vis1[i] && i < len1) printf("%c", str1[i ++]);
                    while (!vis2[j] && j < len2) printf("%c", str2[j ++]);
                    if (vis1[i] && i < len1) {
                        printf("%c", str1[i ++]);
                        j ++;
                    }
                    if (i >= len1 && j >= len2) break;
                }
                printf("
    ");
            }
        }
    
        return 0;
    }
  • 相关阅读:
    2018
    线程的五大状态
    SQL 列转行与行转列
    python中元组(tuple)的拆包unkacping
    python字典的相关操作总结
    C语言使用typedef进行类型重定义
    C++中namespace的用法理解
    ping: unknown host 解决办法
    go环境变量配置liteide配置
    svn出现Authorization failed
  • 原文地址:https://www.cnblogs.com/LinKArftc/p/4962201.html
Copyright © 2011-2022 走看看