HDU 1159 Common Subsequence--最长公共子序列
2013-06-29 21:04
776 查看
dp[i][j] 表示状态:第一个序列前i个,和第二个序列前j个的最长公共子序列
#include<stdio.h> #include<string.h> char a[1000]; char b[1000]; int dp[1000][1000]; int i,j,k; int main() { while(scanf("%s",a+1)!=EOF) { scanf("%s",b+1); int al=strlen(a+1); int bl=strlen(b+1); for(i=0;i<=al;i++) dp[i][0]=0; for(i=0;i<=bl;i++) dp[0][i]=0; for(i=1;i<=al;i++) for(j=1;j<=bl;j++) { if(a[i]==b[j]) dp[i][j]=dp[i-1][j-1]+1; else dp[i][j]=dp[i-1][j]>dp[i][j-1]?dp[i-1][j]:dp[i][j-1]; } printf("%d\n",dp[al][bl]); } }
相关文章推荐
- HDU 1159 Common Subsequence 最长公共子序列 详解
- hdu 1159 Common Subsequence(最长公共子序列)
- HDU 1159 Common Subsequence (动规+最长公共子序列)
- 最长公共子序列(dp) & hdu 1159 Common Subsequence
- 每日三题-Day4-C(HDU 1159 Common Subsequence 最长公共子序列O(nlogn)解法)
- hdu 1159 Common Subsequence【最长公共子序列】
- hdu 1159 Common Subsequence(最长公共子序列)
- hdu1159 Common Subsequence_LCS最长公共子序列
- HDU1159 Common Subsequence(最长公共子序列LCS)
- HDU 1159 Common Subsequence--DP--(最长公共子序列)
- HDU 1159:Common Subsequence(最长公共子序列)
- POJ 1458 & HDU 1159 - Common Subsequence(最长公共子序列)
- hdu 1159 Common Subsequence(LCS最长公共子序列)
- HDU 1159 Common Subsequence(DP最长公共子序列)
- HDU - 1159 Common Subsequence(LCS最长公共子序列)
- HDU 1159 Common Subsequence --- DP入门之最长公共子序列
- HDU 1159 Common Subsequence 最长公共子序列
- HDU-1159-CommonSubsequence(LCS最长公共子序列)
- hdu【1159】Common Subsequence 【最长公共子序列】
- hdu 1159 Common Subsequence_LCS(最长公共子序列)