zoukankan      html  css  js  c++  java
  • HDU Problem 1159 Common Subsequence 【LCS】

    Common Subsequence

                                                                         Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
                                                                                               Total Submission(s): 34180    Accepted Submission(s): 15584

    Problem Description
    A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = <x1, x2, ..., xm> another sequence Z = <z1, z2, ..., zk> is a subsequence of X if there exists a strictly increasing sequence <i1, i2, ..., ik> of indices of X such that for all j = 1,2,...,k, xij = zj. For example, Z = <a, b, f, c> is a subsequence of X = <a, b, c, f, b, c> with index sequence <1, 2, 4, 6>. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X and Y. 
    The program input is from a text file. Each data set in the file contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct. For each set of data the program prints on the standard output the length of the maximum-length common subsequence from the beginning of a separate line. 
     
    Sample Input
    abcfbc abfcab programming contest abcd mnp
     
    Sample Output
    4 2 0
     
    Source
     
    Recommend
    Ignatius   |   We have carefully selected several similar problems for you:  1058 1069 1421 1203 1160 
     
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    using namespace std;
    char str1[1010], str2[1010];
    int dp[1010][1010];
    int main() {
        while (scanf("%s%s", &str1, &str2) != EOF) {
            int len1 = strlen(str1);
            int len2 = strlen(str2);
            memset(dp, 0, sizeof(dp));
            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]);
                }
            }
            printf("%d
    ",dp[len1][len2]);
        }
        return 0;
    }
     



  • 相关阅读:
    Android网络开发的那些事儿
    first day to Ruby on rails
    [转]Windows SDK与DirectX SDK集成
    Windows8
    [转]MPI--MPI+VS2010 配置及编译
    codeblock添加头文件路径和静态库路径
    汇编笔记1:debug
    Eclipse Error
    Android SDk 离线安装方法
    求一程序员合租,回龙观东大街地铁站十分钟,精装次卧2000,无需押金,一共两家
  • 原文地址:https://www.cnblogs.com/cniwoq/p/6770835.html
Copyright © 2011-2022 走看看