poj 1458 Common Subsequence (DP:LCS)
来源:互联网 发布:mac 因为找不到原身 编辑:程序博客网 时间:2024/06/05 20:15
/* 最基础的LCS,不解释,直接贴代码 */#include <cstdio>#include <cstring>#include <algorithm>#define MAXN 500using namespace std;char str1[MAXN], str2[MAXN];int dp[MAXN][MAXN];int main(void) { int len1, len2; while(scanf("%s%s", str1+1, str2+1) != EOF) { int len1 = strlen(str1+1); int len2 = strlen(str2+1); memset(dp, 0, sizeof(dp)); for(int i=1; i<=len1; ++i) { for(int j=1; j<=len2; ++j) { dp[i][j] = max(dp[i-1][j], dp[i][j-1]); if(str1[i] == str2[j]) dp[i][j] = dp[i-1][j-1]+1; } } printf("%d\n", dp[len1][len2]); } return 0;}
0 0
- POJ 1458 Common Subsequence (DP,LCS)
- poj 1458 Common Subsequence (DP:LCS)
- POJ 1458 Common Subsequence DP(LCS)
- 【DP|LCS】POJ-1458 Common Subsequence
- Poj 1458 Common Subsequence【LCS】【dp】
- POJ 3548 Common Subsequence (LCS,dp)
- POJ 1458-Common Subsequence(线性dp/LCS)
- poj 1458 Common Subsequence(LCS)
- poj - 1458 - Common Subsequence(LCS)
- poj 1458 Common Subsequence(lcs模板)
- POJ:1458 Common Subsequence(LCS)
- poj 1458 Common Subsequence(LCS)
- poj 1458 Common Subsequence(lcs)
- POJ 1458 Common Subsequence(LCS)
- POJ 1458 Common Subsequence(LCS)
- Poj 1458 Common Subsequence(LCS)
- POJ 1458 Common Subsequence(lcs)
- POJ 1458--Common Subsequence【LCS】
- 我的oracle笔记-07 之 完结篇
- s3c2440操作norflash EN29LV160AB
- bat字符串替换
- Redis设置过期时间
- UVa 297 四分树
- poj 1458 Common Subsequence (DP:LCS)
- 字符串null和“”的区别
- hnu 12921 Enterprising Escape
- 【Oracle】RAC 10.2.0.1升级10.2.0.5
- LeetCode总结 -- 一维数据合并篇
- Oracle R12 多组织访问的控制 - MOAC(Multi-Org Access Control)
- poj 2250 Compromise (DP:LCS加强版+记忆化搜索)
- 除法(Division ,UVA 725)-ACM集训
- C++ primer 第五版 中文版 9.3.4 节练习