UVaOJ_10405 - Longest Common Subsequence
来源:互联网 发布:c语言基础编程题 编辑:程序博客网 时间:2024/05/17 23:07
Problem C: Longest Common Subsequence
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
Problem Setter: Piotr Rudnicki
注意数组越界,字符串中可以包含空格,所以写输入模块时要注意,不然就是Wrong answer!!!
#include <stdio.h>#include <string.h>int fun();char ch1[1010];char ch2[1010];int LCS[1010][1010];int main(){while(fgets(ch1, 1010, stdin) && fgets(ch2, 1010, stdin)){printf("%d\n", fun());}}int fun(){int len1 = strlen(ch1) - 1;int len2 = strlen(ch2) - 1;int i, j;memset(LCS, 0, sizeof(LCS)); for(i = 1; i <= len1; i++)for(j = 1; j <= len2; j++){if(ch1[i-1] == ch2[j-1])LCS[i][j] = LCS[i-1][j-1] + 1;else if(LCS[i-1][j] >= LCS[i][j-1])LCS[i][j] = LCS[i-1][j];elseLCS[i][j] = LCS[i][j-1];}return LCS[len1][len2];}
0 0
- UVaOJ_10405 - Longest Common Subsequence
- longest common subsequence
- Longest Common Subsequence
- 10405 Longest Common Subsequence
- UVa10405 - Longest Common Subsequence
- 10405 - Longest Common Subsequence
- UVa10405 - Longest Common Subsequence
- UVaOJ10405 - Longest Common Subsequence
- 10405 - Longest Common Subsequence
- uva10405 Longest Common Subsequence
- 10405 - Longest Common Subsequence
- 10405 - Longest Common Subsequence
- Uva10405 Longest Common Subsequence
- Longest common subsequence / substring
- uva10405 - Longest Common Subsequence
- longest common subsequence 问题
- [DP]Longest Common Subsequence
- UVA10405 Longest Common Subsequence
- 多线程编程4 - GCD
- 王宪明的文章:Android4.2锁屏流程【Android锁屏解析三】
- 2014-04-04
- C#调用mysql存储过程方法
- Android通过JNI操作串口《三》
- UVaOJ_10405 - Longest Common Subsequence
- 获取ios设备所有图片
- redhat5.1的samba的配置及安装
- svn diff
- 多线程编程3 - NSOperationQueue
- 通过批处理来操作samba
- Android通过JNI操作串口《四》
- 6
- Python正则表达式指南