zoukankan      html  css  js  c++  java
  • tzoj1510 Common Subsequence(最长公共子序列LCS模板)

    时间限制(普通/Java):1000MS/10000MS     内存限制:65536KByte

    描述

    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.

    样例输入

    abcfbc abfcab
    programming contest
    abcd mnp

     

    样例输出

    4
    2
    0

     

    题目来源

    Southeastern Europe 2003

     

     

     1 #include<cstdio>
     2 #include<cstring>
     3 #include<algorithm>
     4 using namespace std;
     5 const int N = 1000;
     6 char a[N],b[N];
     7 int dp[N][N];
     8 int main()
     9 {
    10     int lena,lenb,i,j;
    11     while(scanf("%s%s",a,b)!=EOF)
    12     {
    13         memset(dp,0,sizeof(dp));
    14         lena=strlen(a);
    15         lenb=strlen(b);
    16         for(i=1;i<=lena;i++)
    17         {
    18             for(j=1;j<=lenb;j++)
    19             {
    20                 if(a[i-1]==b[j-1])
    21                 {
    22                     dp[i][j]=dp[i-1][j-1]+1;
    23                 }
    24                 else
    25                 {
    26                     dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
    27                 }
    28             }
    29         }
    30         printf("%d
    ",dp[lena][lenb]);
    31     }
    32     return 0;
    33 }

     

     

  • 相关阅读:
    BlockUI常见问题
    AssemblyInfo文件
    asp.net 如何让虚拟目录里面的webconfig不继承主目录config(转)
    jquery Ajax示例
    jQuery Ajax 实例 全解析 (转)
    如何在ASP.NET服务器控件库中嵌入JavaScript脚本文件(转)
    如何使用ASP.NET2.0的“嵌入的资源”(转)
    BlockUI对话框
    Jquery ajax参数设置
    What's production quality
  • 原文地址:https://www.cnblogs.com/ChangeG1824/p/11979104.html
Copyright © 2011-2022 走看看