hdu 1159 Common Subsequence【最长公共子序列】
2016-12-02 10:49
429 查看
Common Subsequence
Problem DescriptionA 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
【动态转移核心代码】
![](http://static.blog.csdn.net/xheditor/xheditor_emot/default/titter.gif)
if(a[i-1] == b[j-1]) dp[i][j]=dp[i-1][j-1]+1; else dp[i][j]= max(dp[i-1][j], dp[i][j-1]);
AC代码:
#include<cstdio>
#include<cstring>
char a[1005], b[1005];
int dp[1005][1005];
int max(int a, int b)
{
if(a >= b) return a;
return b;
}
int main()
{
while(~scanf("%s %s", a, b))
{
int la=strlen(a);
int lb=strlen(b);
for(int i = 0; i <= la; i++)
dp[i][0] = 0;
for(int j = 0; j <= lb; j++)
dp[0][j] = 0;
for(int i = 1; i <= la; i++)
{
for(int j = 1; j <= lb; j++)
{
if(a[i-1] == b[j-1]) dp[i][j]=dp[i-1][j-1]+1; else dp[i][j]= max(dp[i-1][j], dp[i][j-1]);
}
}
printf("%d\n", dp[la][lb]);
}
return 0;
}
相关文章推荐
- HDU1159 Common Subsequence【最长公共子序列】
- hdu 1159 Common Subsequence(最长公共子序列 DP)
- hdu 1159 Common Subsequence_LCS(最长公共子序列)
- HDU 1159(Common Subsequence)最长公共子序列
- hdu1159 Common Subsequence 最长公共子序列 经典DP
- 最长公共子序列(dp) & hdu 1159 Common Subsequence
- HDU 1159 Common Subsequence--最长公共子序列
- HDU-1159 Common Subsequence(最长公共子序列)
- HDU 1159 Common Subsequence (求两个串的最长公共子序列 dp)
- hdu 1159 Common Subsequence 最长公共子序列
- 最长公共子序列DP Common Subsequence HDU 1159
- HDU 1159 Common Subsequence--DP--(最长公共子序列)
- hdu 1159 Common Subsequence(DP最长公共子序列)
- hdu 1159 Common Subsequence(DP最长公共子序列)
- hdu 1159 Common Subsequence(动态规划:最长公共子序列)
- HDU 1159 Common Subsequence(最长公共子序列)dp
- 【HDU】1159 Common Subsequence(DP、最长公共子序列)
- HDU 1159 - Common Subsequence [最长公共子序列]
- HDU 1159 Common Subsequence(最长公共子序列的长度)
- HDU 1159 Common Subsequence(DP最长公共子序列)