UVa 10405 Longest Common Subsequence (DP&LCS)
来源:互联网 发布:ps怎样制作淘宝详情页 编辑:程序博客网 时间:2024/05/17 01:29
10405 - Longest Common Subsequence
Time limit: 3.000 seconds
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=114&page=show_problem&problem=1346
Sequence 1:
Sequence 2:
Given two sequences of characters, print the length of the longest common subsequence of both sequences. For example, the longest common subsequence of the following two sequences:
abcdghaedfhris adh of length 3.
Input consists of pairs of lines. The first line of a pair contains the first string and the second line contains the second string. Each string is on a separate line and consists of at most 1,000 characters
For each subsequent pair of input lines, output a line containing one integer number which satisfies the criteria stated above.
Sample input
a1b2c3d4ezz1yy2xx3ww4vvabcdghaedfhrabcdefghijklmnopqrstuvwxyza0b0c0d0e0f0g0h0i0j0k0l0m0n0o0p0q0r0s0t0u0v0w0x0y0z0abcdefghijklmnzyxwvutsrqpoopqrstuvwxyzabcdefghijklmn
Output for the sample input
432614
模板题?
完整代码:
/*0.068s*/#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn = 1010;char a[maxn], b[maxn];int dp[maxn][maxn];int main(void){while (gets(a)){gets(b);int lena = strlen(a), lenb = strlen(b);memset(dp, 0, sizeof(dp));for (int i = 1; i <= lena; ++i)for (int j = 1; j <= lenb; ++j)dp[i][j] = (a[i - 1] == b[j - 1] ? dp[i - 1][j - 1] + 1 : max(dp[i][j - 1], dp[i - 1][j]));printf("%d\n", dp[lena][lenb]);}return 0;}
- UVA 10405 Longest Common Subsequence (dp + LCS)
- UVa 10405 Longest Common Subsequence (DP&LCS)
- uva 10405 - Longest Common Subsequence(LCS)
- UVA 10405 Longest Common Subsequence --经典DP
- uva--10405Longest Common Subsequence+dp
- Uva 10405-Longest Common Subsequence(DP)
- uva 10405 Longest Common Subsequence 最长公共子序列 LCS
- UVA - 10405 Longest Common Subsequence(动态规划:LCS)
- (Relax DP1.6)UVA 10405Longest 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
- uva 10405 - Longest Common Subsequence
- UVA 10405 Longest Common Subsequence
- UVa 10405 - Longest Common Subsequence
- 【Win7开始的搜索框消失了教你找回】
- 设置透明度(2)auto CAD .NET二次开发
- 疯狂程序员(3)
- 利用chrome的调试功能调试JavaScript代码
- GLIBC内存分配机制引发的“内存泄露”
- UVa 10405 Longest Common Subsequence (DP&LCS)
- 算法学习
- 导入Active控件,可能用到的invokehelper
- Python Redis 数据复制
- innerHTMl用法
- Linux 操作系统启动过程 【以Ubuntu 12.04 为例】
- 疯狂程序员(4)
- Socket类的构造函数和方法
- 【数据结构】二叉树