UVA - 10405 Longest Common Subsequence(动态规划:LCS)
来源:互联网 发布:ubuntu home 改成英文 编辑:程序博客网 时间:2024/05/22 02:23
点击打开链接
被空格坑了一下下……
要用gets(),若读取不到字符串则返回NULL(读EOF)
#include <iostream>#include <cstdio>#include <cstring>using namespace std;const int MAX_N = 1010;int N;int dp[MAX_N][MAX_N];char s[MAX_N], t[MAX_N];int LCS(char s[], char t[]){int 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]);return dp[n][m];}int main(){//freopen("in.txt", "r", stdin);//while(scanf("%s%s", s, t) != EOF)while(gets(s) && gets(t)) printf("%d\n", LCS(s, t));return 0;}
0 0
- UVA - 10405 Longest Common Subsequence(动态规划:LCS)
- UVA 10405 Longest Common Subsequence (dp + LCS)
- uva 10405 - Longest Common Subsequence(LCS)
- UVa 10405 Longest Common Subsequence (DP&LCS)
- 动态规划-uva-10405-Longest Common Subsequence
- 动态规划(DP)---LCS(the Longest Common Subsequence)
- uva 10405 Longest Common Subsequence 最长公共子序列 LCS
- 动态规划LCS问题( HDU - 1159 Common Subsequence)
- HDU 1159 Common Subsequence (动态规划LCS)
- 【common subsequence】动态规划+回溯求LCS
- 【算法导论学习-29】动态规划经典问题02:最长公共子序列问题(Longest common subsequence,LCS)
- 【算法导论学习-29】动态规划经典问题02:最长公共子序列问题(Longest common subsequence,LCS)
- Uva 10405-Longest Common Subsequence(DP)
- 动态规划解最长公共子序列问题LCS(longest common subsequence)
- Dynamic Programming longest common subsequence(LCS) 动态规划之最长公共子序列
- 最长公共子序列 (LCS,longest common subsequence problem) 动态规划
- [动态规划] [LCS算法] 最长公共子序列 longest common subsequence
- UVa 10405 Longest Common Subsequence
- C语言经典算法100例-027-用递归逆序输出字符
- Sum of Consecutive Prime Numbers III
- Android 自定义title
- JDciom安装出现“unable to install JRE 1.3 on your system”
- 好好利用Github管理自己的代码
- UVA - 10405 Longest Common Subsequence(动态规划:LCS)
- leetcode Add Two Numbers
- 教练是协助者
- 黑马程序员-JAVA if语句练习
- linux间通讯
- 用两个栈实现队列&&旋转非递减数列的最小值
- sqlite3
- My97DatePicker时间控件使用
- Linux python使用mysql数据库