UVa 10405 - Longest Common Subsequence
来源:互联网 发布:java 集合的不同点 编辑:程序博客网 时间:2024/06/10 01:20
最长公共子序列。
代码如下:
#include <stdio.h>#include <string.h>int dp[1002][1002];int iMax(int a, int b){ if(a > b) return a; return b;}int main(){ char str1[1002], str2[1002]; while(gets(str1) != NULL) { gets(str2); int len1 = strlen(str1); int len2 = strlen(str2); for(int i=0; i<1001; i++) dp[i][0] = dp[0][i] = 0; for(int i=1; i<=len1; ++i) for(int j=1; j<=len2; ++j) { if(str1[i-1] == str2[j-1]) { dp[i][j] = dp[i - 1][j - 1] + 1; } else { dp[i][j] = iMax(dp[i][j - 1], dp[i - 1][j]); } } printf("%d\n", dp[len1][len2]); } return 0;}
- 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
- 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
- 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
- 利用队列实现层序遍历
- 可横屏左右滑动的GridView
- Linux下patch的制作和应用
- YUV格式的解析
- /etc/security/limit.conf 配置
- UVa 10405 - Longest Common Subsequence
- Android 4.0 触摸屏驱动调试记录 及 git patch相关内容
- linux的命令行成了 -bash-4.1#
- linux内核可装载模块(lkm)传参机制 module_param
- C语言:内存字节对齐详解
- 【Project Euler】【Problem 7】10001st prime
- Android应用程序结构及开发流程
- Android 创建新的Product
- 关于python strip