hdu 1159 && poj 1458 Common Subsequence (LCS)
2014-01-18 10:01
465 查看
求字符串的最长公共子序列
DP方程:
if(i==0||j==0)matrix[i][j]=0;
if(s1[i-1]==s2[j-1])matrix[i][j]=matrix[i-1][j-1]+1;
if(s1[i-1]!=s2[j-1])matrix[i][j]=max(matrix[i-1][j],matrix[i][j-1]);
DP方程:
if(i==0||j==0)matrix[i][j]=0;
if(s1[i-1]==s2[j-1])matrix[i][j]=matrix[i-1][j-1]+1;
if(s1[i-1]!=s2[j-1])matrix[i][j]=max(matrix[i-1][j],matrix[i][j-1]);
#include<cstdio> #include<iostream> #include<cstring> #include<algorithm> using namespace std; char a[1000],b[1000]; int dp[1005][1005]; int main() { int len1,len2; while(scanf("%s%s",a,b)!=EOF) { len1=strlen(a); len2=strlen(b); for(int i=0;i<=len2;i++) dp[0][i]=0; for(int i=0;i<=len1;i++) dp[i][0]=0; for(int i=1;i<=len1;i++) { for(int j=1;j<=len2;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[len1][len2]); } return 0; }
相关文章推荐
- HDU1159 && POJ1458 Common Subsequence (LCS)
- HDU 1159 & POJ 1458 Common Subsequence(LCS 最长公共子序列O(nlogn))
- POJ 1458 && HDU 1159 Common Subsequence(LCS)
- hdu 1159 && POJ 1458Common Subsequence(LCS)
- HDU 1159 & POJ 1458 Common Subsequence 【LCS】
- POJ 1458 / HDU 1159 / Southeastern Europe 2003 Common Subsequence (DP&LCS)
- POJ 1458 & HDU 1159 - Common Subsequence(最长公共子序列)
- HDU/HDOJ 1159/POJ 1458 Common Subsequence(最长公共子序列LCS,滚动数组)
- HDU 1159 && POJ 1458【lcs】
- HDU1159 && POJ1458:Common Subsequence(LCS)
- HDU1159 && POJ1458:Common Subsequence(LCS)
- HDU 1159 Common Subsequence(POJ 1458)
- HDU1159 && POJ1458:Common Subsequence(LCS)
- [HDU - 1159] Common Subsequence(动态规划&&LCS)
- poj 1458 Common Subsequence --- LCS模板
- POJ1458 Common Subsequence LCS问题入门题[DP]
- POJ 1458 Common Subsequence(LCS)
- HDU 1159 Common Subsequence (LCS)
- HDU 1159 Common Subsequence(LCS)
- poj1458--Common Subsequence--最长公共子序列LCS