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

    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.
    Input

    abcfbc abfcab
    programming contest 
    abcd mnp

    Output

    4
    2
    0

    Sample Input

    abcfbc abfcab
    programming contest 
    abcd mnp

    Sample Output

    4
    2
    0
     1 #include<iostream>
     2 #include<algorithm>
     3 #include<cstdio>
     4 #include<string>
     5 #include<cstring>
     6 using namespace std;
     7 
     8 string s1;
     9 string s2;
    10 int dp[1005][1005];
    11 
    12 int main()
    13 {   while(cin>>s1>>s2){
    14         int len=s1.size(),lenth=s2.size(),ans=0;
    15         memset(dp,0,sizeof(dp));
    16         for(int i=1;i<=len;i++){
    17             for(int j=1;j<=lenth;j++){
    18                 if(s1[i-1]==s2[j-1]) dp[i][j]=dp[i-1][j-1]+1;
    19                 else dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
    20                 ans=max(ans,dp[i][j]);
    21             }
    22         }
    23         printf("%d
    ",ans);
    24     }
    25     return 0;
    26 }
  • 相关阅读:
    浏览器漫谈
    无尽的烦恼
    微软的无聊
    作软件的人永远都是受气包吗?
    除非迫不得已不要用游标
    公司进行改革,路该如何走?
    Performance best practices for Web services
    HowTO: Create an Event Log Source in code, without the Permission errors
    Team Foundation Server安装指南
    百年不遇的,我遇到了两次
  • 原文地址:https://www.cnblogs.com/zgglj-com/p/6810457.html
Copyright © 2011-2022 走看看