杭电-1159 Common Subsequence(最长公共子序列)
来源:互联网 发布:netbeans php xdebug 编辑:程序博客网 时间:2024/05/17 09:10
Common Subsequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 34214 Accepted Submission(s): 15596
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
Recommend
Ignatius | We have carefully selected several similar problems for you: 1058 1069 1421 1160 2602
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int main(){char a[1110];char b[1110];int dp[1110][1110];int n,m,i,j;while(scanf("%s%s",a,b)!=EOF){memset(dp,0,sizeof(dp));n=strlen(a);m=strlen(b);for(i=1;i<=n;i++){for(j=1;j<=m;j++){if(a[i-1]==b[j-1]) dp[i][j]=dp[i-1][j-1]+1;else dp[i][j]=max(dp[i-1][j],dp[i][j-1]);}}printf("%d\n",dp[n][m]);}return 0;}
0 0
- 杭电-1159 Common Subsequence(最长公共子序列)
- Common Subsequence(最长公共子序列)
- hdu 1159 Common Subsequence ***poj1458(最长公共子序列)
- 1159Common Subsequence(最长公共子序列)
- HDU 1159:Common Subsequence(最长公共子序列)
- hdu 1159 Common Subsequence(最长公共子序列)
- HDU 1159 Common Subsequence(最长公共子序列)
- HDU 1159 Common Subsequence(最长公共子序列)
- HDU 1159 Common Subsequence--DP--(最长公共子序列)
- HD 1159 Common Subsequence (最长公共子序列)
- HDU 1159 Common Subsequence(DP最长公共子序列)
- hdu 1159 Common Subsequence(最长公共子序列问题)
- hdu 1159 Common Subsequence (最长公共子序列)
- HDU-1159-Common Subsequence(最长公共子序列)
- HDU 1159 Common Subsequence(最长公共子序列)dp
- hdu 1159 Common Subsequence (最长公共子序列 +代码)
- HDU 1159 Common Subsequence (最长公共子序列)
- 【HDU 1159】Common Subsequence (最长公共子序列)
- web前端选项卡的写法
- gulp教程之gulp-less
- 为什么Java byte 类型的取值范围是-128~127
- 跳槽与最近
- 基于cordova的webapp在线生成思路
- 杭电-1159 Common Subsequence(最长公共子序列)
- Android 万恶的三星note3拍照和图片裁剪适配
- VS2010/MFC编程入门之十二(对话框:非模态对话框的创建及显示)
- net.sf.json.JSONException: Unterminated string at character 1801
- iOS系列版本更新上架流程
- Openstack -- Horizon二次开发(二)
- hdoj2066一个人的旅行(jijkstra)
- css常用属性
- ubuntu下安装opencv,cmake出错,解决方法