HDU 1159 Common Subsequence (求两个串的最长公共子序列 dp)
2014-04-04 13:58
543 查看
/* 78ms 题意:求两个串的最长公共子序列 代码中的dp[i][j]表示0到i-1跟0到j-1的最长公共子序列 */ #include<vector> #include<iostream> #include<cstdio> #include<cstring> using namespace std; int dp[1001][1001]; int main() { char a[1001],b[1001]; while(cin>>a>>b) { int i,j; int la=strlen(a),lb=strlen(b); memset(dp,0,sizeof(dp)); for(i=1;i<=la;i++) { for(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; }
相关文章推荐
- 最长公共子序列DP Common Subsequence HDU 1159
- HDU 1159 Common Subsequence(DP最长公共子序列)
- hdu 1159 Common Subsequence(最长公共子序列 DP)
- HDU 1159 Common Subsequence【dp+最长公共子序列】
- hdu 1159 Common Subsequence(最长公共子序列,DP)
- HDU 1159 Common Subsequence--DP--(最长公共子序列)
- 【HDU】1159 Common Subsequence(DP、最长公共子序列)
- HDU 1159 Common Subsequence --- DP入门之最长公共子序列
- hdu 1159 Common Subsequence(DP最长公共子序列)
- hdu1159 Common Subsequence 最长公共子序列 经典DP
- 最长公共子序列(dp) & hdu 1159 Common Subsequence
- HDU 1159 Common Subsequence(最长公共子序列)dp
- hdu 1159 Common Subsequence(最长公共子序列 DP)
- hdu 1159 Common Subsequence(DP最长公共子序列)
- HDU 1159 Common Subsequence(最长公共子序列)
- HDU 1159(Common Subsequence)最长公共子序列
- HDU 1159 Common Subsequence(最长公共子序列的长度)
- hdu1159 Common Subsequence--DP
- HDU 1159 Common Subsequence 最长公共子序列
- HDU 1159 - Common Subsequence [最长公共子序列]