HDU1159
来源:互联网 发布:ui windows api 编辑:程序博客网 时间:2024/06/05 21:11
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30731 Accepted Submission(s): 13901
Problem Description
A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = <x1, x2, ..., xm> another sequence Z = <z1, z2, ..., zk> is a subsequence of X if there exists a strictly increasing sequence <i1, i2, ..., ik> of indices of X such that for all j = 1,2,...,k, xij = zj. For example, Z = <a, b, f, c> is a subsequence of X = <a, b, c, f, b, c> with index sequence <1, 2, 4, 6>. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X and Y.
The program input is from a text file. Each data set in the file contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct. For each set of data the program prints on the standard output the length of the maximum-length common subsequence from the beginning of a separate line.
The program input is from a text file. Each data set in the file contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct. For each set of data the program prints on the standard output the length of the maximum-length common subsequence from the beginning of a separate line.
Sample Input
abcfbc abfcabprogramming contest abcd mnp
Sample Output
420
没有任何难度的LCS问题
#include<stdio.h>#include<string.h>char a[10009], b[10009];int c[10009][10009];int max(int x, int y){if (x>y)return x;elsereturn y;}int main(){int i, j, x, y;while (scanf("%s %s", a, b) != EOF){x = strlen(a);y = strlen(b);for (i = 0; i <= x; i++)c[0][i] = 0;for (i = 0; i<x; i++){for (j = 0; j<y; j++){if (a[i] == b[j])c[i + 1][j + 1] = c[i][j] + 1;elsec[i + 1][j + 1] = max(c[i][j + 1], c[i + 1][j]);}}printf("%d\n", c[x][y]);}return 0;}
0 0
- hdu1159
- hdu1159
- hdu1159
- hdu1159
- hdu1159
- hdu1159
- HDU1159
- hdu1159
- HDU1159
- hdu1159 LCS
- poj1458 hdu1159
- HDU1159 Common Subsequence (LCS)
- HDU1159--Common Subsequence
- hdu1159-Common Subsequence
- hdu1159 Common Subsequence
- HDU1159 Common Subsequence
- HDU1159:Common Subsequence
- hdu1159 Common Subsequence DP
- mysql mongodb PostgreSQL运用技能
- java 注解 详解
- ECShop出现Strict Standards: Only variables should be passed by reference in的解决方法
- CSS设置渐变背景色
- Android中Handler Runnable与Thread的区别详解
- HDU1159
- 算法:交换排序之冒泡排序
- java正则表达式基本符号
- 操作系统课程设计之二级文件系统演示
- spfile,pfile和init.ora的区别
- MySQL中的LOCATE和POSITION函数使用方法
- Zeroc Ice grid 研究学习
- HTTP 协议详解
- OracleCommand 参数不会自动匹配