zoukankan      html  css  js  c++  java
  • Common Subsequence(lcs)

    Common Subsequence
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 43194   Accepted: 17514

    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.

    Input

    The program input is from the std input. Each data set in the input contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct.

    Output

    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

    题解:经典lcs问题;

    代码:

     1 #include<stdio.h>
     2 #include<string.h>
     3 #define MAX(a,b) (a>b?a:b)
     4 const int MAXN=1010;
     5 int dp[MAXN][MAXN];
     6 char a[MAXN],b[MAXN];
     7 int main(){
     8 while(~scanf("%s%s",a+1,b+1)){
     9     memset(dp,0,sizeof(dp));
    10     int i,j;
    11     for( i=1;a[i];i++){
    12         for(j=1;b[j];j++){
    13             if(a[i]==b[j])dp[i][j]=dp[i-1][j-1]+1;
    14             else dp[i][j]=MAX(dp[i][j-1],dp[i-1][j]);
    15         }
    16     }
    17     printf("%d
    ",dp[i-1][j-1]);
    18 }
    19 return 0;}
  • 相关阅读:
    生成数据库结构设计说明书的存储过程
    C#检测上传图片是否安全函数
    设定下拉列表控件DropDownList,复选按钮CheckBox,RadioButton默认值总结测试
    C#批量重命名工具V2.0
    个人一些工作经验方式积累办法
    修身《孟子》尽心篇
    linux 命令 lspci lsusb
    重拾信心
    linux eclipse
    A lunch in Gordon Market with WWF
  • 原文地址:https://www.cnblogs.com/handsomecui/p/4717375.html
Copyright © 2011-2022 走看看