UVA 10405 LONGEST COMMON SUBSEQUENCE(最长公共子序列)
2014-04-15 17:40
489 查看
传送门:UVA10405
直接上代码:
直接上代码:
#include <iostream> #include <cstring> #include <cstdio> using namespace std; #define MAX 1005 int n,m; int dp[MAX][MAX]; char s[MAX],t[MAX]; int main() { while(gets(s)&&gets(t)) { n=strlen(s); m=strlen(t); memset(dp,0,sizeof(dp)); for(int i=0;i<n;i++) { for(int j=0;j<m;j++) { if(s[i]==t[j]) dp[i+1][j+1]=dp[i][j]+1; else dp[i+1][j+1]=max(dp[i][j+1],dp[i+1][j]); } } cout<<dp [m]<<endl; } return 0; }
相关文章推荐
- 数组字符串uva 10405 - Longest Common Subsequence(最长公共子序列)
- (Relax DP1.6)UVA 10405 Longest Common Subsequence(使用DP来求解最长公共子序列LCS)
- UVa 10405 - Longest Common Subsequence,最长公共子序列模板题
- UVa 10405 - Longest Common Subsequence 最长公共子序列模板
- uva 10405 Longest Common Subsequence (最长公共子序列)
- UVa 10405 - Longest Common Subsequence 最长公共子序列模板
- uva 10405 - Longest Common Subsequence(最长公共子序列)
- uva 10405 Longest Common Subsequence 最长公共子序列 LCS
- uva 10405 Longest Common Subsequence(最长公共子序列)
- 【解题报告】uva10405_Longest Common Subsequence(最长公共子序列, dp)
- uva 10405 - Longest Common Subsequence(最长公共子序列)
- uva10405 - Longest Common Subsequence(LCS,最长公共子序列)
- Longest Common Subsequence - UVa 10405 最长公共子序列(数据有坑)
- UVA - 10405 Longest Common Subsequence (LCS最长公共子序列)
- UVA 10405 Longest Common Subsequence(最长公共子序列)
- UVA 10405 Longest Common Subsequence (动态规划 LCS)
- uva 10405 - Longest Common Subsequence(LCS)
- uva10405 Longest Common Subsequence
- UVa 10405 Longest Common Subsequence (DP&LCS)
- UVA 10405 - Longest Common Subsequence