zoukankan      html  css  js  c++  java
  • POJ 1458

    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, x ij = 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,现学现用。
    dp[i+1][j+1] = dp[i][j] + 1 (a[i] == b[j])
    dp[i+1][j+1] = max(dp[i][j+1],dp[i+1][j]) (a[i] != b[j])
    #include <iostream>
    #include <string>
    #define M 1005
    using namespace std;
    string a,b;
    int dp[M][M];
    
    int main()
    {
    	while(cin>>a>>b)
    	{
    		for(int i = 0; i < a.length(); i++)
    			for(int j = 0; j < b.length(); j++)
    			{
    				if(a[i] == b[j]) 
    					dp[i+1][j+1] = dp[i][j] + 1;
    				else
    					dp[i+1][j+1] = max(dp[i+1][j],dp[i][j+1]);
    			}
    		cout<<dp[a.length()][b.length()]<<endl;
    	}
    	return 0;
    }
    


  • 相关阅读:
    LightningChartJS2.0即将火热推出,敬请期待!
    html转word
    Windows上使用Python2.7安装pip
    人工智能?.netcore一样胜任!
    远程浏览服务器上的文件
    C# winform间窗体传值简单Demo
    C#发送QQ邮箱
    各种文件用JS转Base64之后的data类型
    当你的VS2019没法自动补全了,或者自动补全按回车直接换行的时候
    easyUI filebox 获取文件对象
  • 原文地址:https://www.cnblogs.com/stul/p/10350502.html
Copyright © 2011-2022 走看看