FZU 1160 Common Subsequence
2009-12-21 23:03
204 查看
Accept: 237 Submit: 510
Time Limit: 1000 mSec Memory Limit : 32768 KB
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.Input
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.Output
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 abfcab programming contest abcd mnpSample Output
4 2 0//dp,跟前面有一题几乎是一样的(动态规划)
#include<iostream> using namespace std; inline int max(int a,int b){return a>b?a:b;} int num[1000][1000]; char c1[1000],c2[1000]; void f(int n,int m) { int i,j; memset(num,0,sizeof(num)); for(i=1;i<=n;i++) for(j=1;j<=m;j++) { if(c1[i-1]==c2[j-1]) num[i][j]=num[i-1][j-1]+1; else num[i][j]=max(num[i][j-1],num[i-1][j]); } } int main() { int n,m; while(scanf("%s%s",c1,c2)!=EOF) { n=strlen(c1); m=strlen(c2); f(n,m); printf("%d/n",num [m]); } return 0; }
相关文章推荐
- Common Subsequence(poj1458)
- POJ1458 Common Subsequence
- LintCode Longest Common Subsequence(最长公共子序列长度,动态规划入门题)
- HDU 1423 - Greatest Common Increasing Subsequence
- 杭电1159——Common Subsequence
- POJ 2127 Greatest Common Increasing Subsequence (动态规划)
- hdu1159 Common Subsequence_LCS最长公共子序列
- hdu 1159 Common Subsequence(DP最长公共子序列)
- [算法] doj 1605 Common Subsequence 公共子序列
- POJ 2127 Greatest Common Increasing Subsequence (最长公共上升子序列+记录路径)
- 5.11 Common Subsequence
- UVaOJ10405 - Longest Common Subsequence
- uva10405 Longest Common Subsequence
- POJ-1458-Common Subsequence
- Poj 1458 Common Subsequence(LCS)
- POJ1458--Common Subsequence(dp)
- HDU1159 && POJ1458:Common Subsequence(LCS)
- Common Subsequence
- HDU1423&POJ2127-Greatest Common Increasing Subsequence
- uva 10405 - Longest Common Subsequence(注意空格陷阱)