【HDU】1159 - Common Subsequence(LCS)
来源:互联网 发布:java数组的逆序输出 编辑:程序博客网 时间:2024/06/02 00:41
点击打开题目
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34330 Accepted Submission(s): 15666
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
Source
Southeastern Europe 2003
LCS的模板题。
代码如下:
#include <stdio.h>#include <cstring>#include <algorithm>using namespace std;#define CLR(a,b) memset(a,b,sizeof(a))#define INF 0x3f3f3f3f#define LL long longint dp[1000][1000];int main(){char a[1000],b[1000];int l1,l2;while (~scanf ("%s %s",a,b)){l1 = strlen(a);l2 = strlen(b);for (int i = 0 ; i <= max(l1,l2) ; i++)dp[i][0] = dp[0][i] = 0;for (int i = 1 ; i <= l1 ; i++){for (int j = 1 ; j <= l2 ; j++){if (a[i-1] == b[j-1])dp[i][j] = dp[i-1][j-1] + 1;elsedp[i][j] = max (dp[i-1][j] , dp[i][j-1]);}}printf ("%d\n",dp[l1][l2]);}return 0;}
0 0
- HDU 1159 Common Subsequence(LCS)
- HDU - 1159 Common Subsequence (简单LCS)
- HDU 1159 Common Subsequence(dp LCS)
- 【HDU】-1159-Common Subsequence(LCS,模板)
- HDU 1159 Common Subsequence(LCS)
- 【HDU】1159 - Common Subsequence(LCS)
- hdu 1159 Common Subsequence (LCS)
- HDU 1159 Common Subsequence【LCS(dp)】
- 【hdu 1159】Common Subsequence(LCS模板)
- Common Subsequence (lcs)【HDU】-1159
- HDU 1159 Common Subsequence(LCS)
- hdu 1159 Common Subsequence (LCS)
- HDU 1159 Common Subsequence(LCS)
- hdu 1159 Common Subsequence(LCS)
- HDU 1159 Common Subsequence【LCS】
- hdu 1159 Common Subsequence (lcs)
- hdu 1159 Common Subsequence(lcs)
- HDU-1159-Common Subsequence【LCS】
- hive高级查询
- poj 2031 Building a Space Station
- finally块中包含return语句对返回值的影响
- 自己写的LinkList
- 简单的gson对boolean转换的test(作为备注)
- 【HDU】1159 - Common Subsequence(LCS)
- git add , git commit 添加错文件 撤销
- Simple Line Editor----CSU 1019
- ios json解析3840错误
- 源码角度解析:StringBuffer、StringBuilder、String
- iTween
- POJ 2031 (最小生成树)
- Ubuntu下编译Android版本的ffmepg so库及源码
- UVALive5198 UVA512 Spreadsheet Tracking