zoukankan      html  css  js  c++  java
  • 解题报告 HDU1159 Common Subsequence

    Common Subsequence
    Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

    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
     
     
    分析:

      设c[i][j]为字符串a的第i个字符与字符串b的第j个字符为止的最长公共子序列长度,那么有两种情况:

    1. 当a[i] == b[j]时,c[i][j]应该是前一个状态的最长公共子序列长度 + 1,因为a[i]与b[j]匹配,a[i]与b[j]必然不能已经匹配过,否则就是同一个字母匹配了多次,这必然是非法的,因此上一个状态应是c[i - 1][j - 1],即c[i][j] = c[i - 1][j - 1] + 1;
    2. 当a[i] != b[j]时,上一个状态可能是c[i - 1][j]或c[i][j - 1],而既然要找最长公共子序列,自然是找最大的一个,即c[i][j] = max(c[i - 1][j], c[i][j - 1])。
    AC代码:
     1 #include<iostream>
     2 #include<string>
     3 using namespace std;
     4 int dp[1005][1005];
     5 int main()
     6 {
     7     string a,b;
     8     while(cin>>a>>b)
     9     {
    10         int alen=a.length();
    11         int blen=b.length();
    12         memset(dp,0,sizeof(dp));
    13         for(int i=1;i<=alen;i++)
    14         {
    15             for(int j=1;j<=blen;j++)
    16             {
    17                 if(a[i-1]==b[j-1])
    18                     dp[i][j]=dp[i-1][j-1]+1;
    19                 else
    20                     dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
    21             }
    22         }
    23         for(int i=1;i<=alen;i++)
    24         {
    25             for(int j=1;j<=blen;j++)
    26                 cout<<dp[i][j]<<" ";
    27             cout<<endl;
    28         }
    29         cout<<dp[alen][blen]<<endl;
    30     }
    31     return 0;
    32 } 
  • 相关阅读:
    C#中如何禁止WindowsMediaPlayer双击全屏显示
    .NET中的泛型概述
    c# Windows服务管理
    C:Program不是内部或外部命令,也不是可运行的程序或批处理文件。
    Wireshark教程之二:Wireshark捕获数据分析
    Wireshark教程之一:认识Wireshark界面
    利用windows服务实现整点报时功能
    在windows服务中使用定时器
    flickity:支持触摸滑动,响应迅速的幻灯片轮播插件
    无法定位 Local Database Runtime 安装。请验证 SQL Server Express 是否正确安装以及本地数据库运行时功能是否已启用。
  • 原文地址:https://www.cnblogs.com/verlen11/p/4240078.html
Copyright © 2011-2022 走看看