1159 Common Subsequence
来源:互联网 发布:软件成本分析报告 编辑:程序博客网 时间:2024/05/29 16:34
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
经典的动态规划题。最长公共子序列。
根据题意写出dp公式
c[i][j]=0 (i==0||j==0)
c[i][j]=c[i-1][j-1](i>0&&j>0&&a[i-1]==b[j-1])
c[i][j]=max(c[i-1][j],c[i][j-1])(i>0&&j>0&&a[i-1]!=b[j-1])
#include<stdio.h>#include<string.h>char a[2015];char b[2015];int c[2015][2015];int main(){int m,n;while(scanf("%s%s",a,b)!=EOF){m=strlen(a);n=strlen(b);for(int i=0;i<=m;i++){c[i][0]=0;}for(int i=0;i<=n;i++){c[0][i]=0;}for(int i=1;i<=m;i++){for(int j=1;j<=n;j++){if(a[i-1]==b[j-1])c[i][j]=c[i-1][j-1]+1;elseif(c[i][j-1]>=c[i-1][j])c[i][j]=c[i][j-1];elsec[i][j]=c[i-1][j];}}printf("%d\n",c[m][n]);}}
0 0
- hdu 1159 Common Subsequence
- HDOJ 1159:Common Subsequence
- hdoj 1159 Common Subsequence
- HDU 1159 Common Subsequence
- HDOJ 1159 Common Subsequence
- HDOJ 1159 Common Subsequence
- HDU 1159 Common Subsequence
- hdu 1159 Common Subsequence
- HDU 1159 Common Subsequence
- HDU 1159 Common Subsequence
- hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence
- hdu 1159 Common Subsequence
- hdoj 1159 Common Subsequence
- 1159 Common Subsequence
- Common Subsequence hdu 1159
- HDU 1159 Common Subsequence
- HDU 1159 Common Subsequence
- a[href*=javablackbelt]{color:red};
- [ASM]Linux平台内联汇编实例
- 线上事故处理总结
- Linux 截图
- http协议详讲
- 1159 Common Subsequence
- LIBMAD解码播放器
- 关于NSString的一些用法
- VIM 使用技巧
- HOG特征+SVM训练过程
- JavaEE面试题,
- JS时间格式化出现2015-02-07 hh:12:30
- hdu 3183 A Magic Lamp(给一个n位的数,从中删去m个数字,使得剩下的数字组成的数最小(顺序不能变),然后输出)
- KMP算法