UVA 10405 - Longest Common Subsequence
2012-03-08 14:00
381 查看
本题是求最长公共子序列,题目也给了提示,是求最长公共子序列最基本的题。
注意字符串的读取要用gets()而不用scanf()因为字符串里可能有空格。
代码如下:
注意字符串的读取要用gets()而不用scanf()因为字符串里可能有空格。
代码如下:
#include<stdio.h> #include<string.h> #define MAXN 1000 + 10 char a[MAXN], b[MAXN]; int f[MAXN][MAXN]; void dp() { int len1 = strlen(a+1); int len2 = strlen(b+1); int max = -1; for(int i = 1; i <= len1; i ++) for(int j = 1; j <= len2; j ++) { if(a[i] == b[j]) f[i][j] = f[i-1][j-1] + 1; else { if(f[i-1][j] > f[i][j-1]) f[i][j] = f[i-1][j]; else f[i][j] = f[i][j-1]; } if(f[i][j] > max) max = f[i][j]; } printf("%d\n",max); } void input() { memset(f,0,sizeof(f)); while(gets(a+1) != NULL) { gets(b+1); dp(); } } int main() { input(); return 0; }
相关文章推荐
- Longest Common Subsequence - UVa 10405 最长公共子序列(数据有坑)
- UVa 10405 & POJ 1458 Longest Common Subsequence
- UVA 10405 Longest Common Subsequence
- UVA 10405-Longest Common Subsequence
- UVA - 10405 Longest Common Subsequence
- UVa10405 - Longest Common Subsequence
- UVa 10405 Longest Common Subsequence (DP&LCS)
- uva 10405 Longest Common Subsequence
- UVA_10405 Longest Common Subsequence(DP)
- uva 10405 Longest Common Subsequence
- uva 10405 Longest Common Subsequence
- UVA 10405 - Longest Common Subsequence
- UVa 10405 - Longest Common Subsequence,最长公共子序列模板题
- UVa10405 - Longest Common Subsequence
- uva10405 Longest Common Subsequence
- uva 10405 Longest Common Subsequence
- UVA 10405 LONGEST COMMON SUBSEQUENCE(最长公共子序列)
- uva10405 - Longest Common Subsequence(LCS)
- UVA 10405 Longest Common Subsequence
- Uva - 10405 - Longest Common Subsequence