HDU1159 Common Subsequence
2014-02-06 17:48
246 查看
Problem 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
Sample Output
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
#include <iostream> using namespace std; int dp[1005][1005]; int main() { freopen("C:\\in.txt","r",stdin); char str1[1005]; char str2[1005]; while(scanf("%s %s",str1,str2)!=EOF){ int len1=strlen(str1); int len2=strlen(str2); memset(dp,0,sizeof(dp)); for(int i=1;i<=len1;i++) for(int j=1;j<=len2;j++){ if(str1[i-1]==str2[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[len1][len2]); } return 0; }
相关文章推荐
- HDU 1159 Common Subsequence
- HDU 1159 Common Subsequence (线性dp 裸LCS)
- HDU 1159 Common Subsequence
- HDU 1159 Common Subsequence 动态规划
- hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence
- HDU-1159-CommonSubsequence(LCS最长公共子序列)
- HDU-1159-Common Subsequence(最长公共子序列)
- hdu 1159 Common Subsequence_LCS(最长公共子序列)
- HDU-1159 Common Subsequence (线性dp 最长公共子串)
- HDU 1159 Common Subsequence(LCS)
- 【水:最长公共子序列】【HDU1159】【Common Subsequence】
- hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence
- HDU 1159 Common Subsequence--DP--(最长公共子序列)
- HDU 1159 & POJ 1458 Common Subsequence(LCS 最长公共子序列O(nlogn))
- HDU 1159 Common Subsequence(DP最长公共子序列)
- hdu 题目1159 Common Subsequence(DP)
- HDU 1159 Common Subsequence(LCS)
- POJ 1458 & HDU 1159 - Common Subsequence(最长公共子序列)