zoukankan      html  css  js  c++  java
  • HDU 1159 Common Subsequence

    http://acm.hdu.edu.cn/showproblem.php?pid=1159

    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

    题解:$dp$ 最长公共子串问题 

    时间复杂度:$O(len1 * len2)$

    代码:

    #include <bits/stdc++.h>
    using namespace std;
    
    const int maxn = 1e5 + 10;
    char s1[maxn], s2[maxn];
    int dp[1010][1010];
    int len1, len2;
    
    void solve() {
        for(int i = 0; i < len1; i ++) {
            for(int j = 0; j < len2; j ++) {
                if(s1[i] == s2[j])
                    dp[i + 1][j + 1] = dp[i][j] + 1;
                else
                    dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]);
            }
        }
        printf("%d
    ", dp[len1][len2]);
    }
    
    int main() {
        while(~scanf("%s%s", s1, s2)) {
            memset(dp, 0, sizeof(dp));
            len1 = strlen(s1);
            len2 = strlen(s2);
    
            solve();
        }
        return 0;
    }
    

      

  • 相关阅读:
    《重构》读书笔记
    每周总结
    《修改代码的艺术》读书笔记
    每周总结
    每周总结
    《修改代码的艺术》读书笔记
    每周总结
    第二周周总结
    以淘宝网为例,描绘质量属性的六个常见属性场景
    机器学习第八讲
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/9687091.html
Copyright © 2011-2022 走看看