Common Subsequence 杭电HDU1159 【动态规划LCS】
来源:互联网 发布:汽车电脑解码软件 编辑:程序博客网 时间:2024/05/18 00:50
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
#include<stdio.h>#include<string.h>#define max(a,b) (a>b?a:b)char s1[1010];char s2[1010];int dp[1010][1010];int main(){ while(scanf("%s%s",s1,s2)!=EOF) { int i,j; int len1=strlen(s1); int len2=strlen(s2); memset(dp,0,sizeof(dp)); for(i=1;i<=len1;++i) { for(j=1;j<=len2;++j) { if(s1[i-1]==s2[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[len1][len2]); } return 0;}
1 0
- Common Subsequence 杭电HDU1159 【动态规划LCS】
- Hdu1159 - Common Subsequence - 动态规划
- HDU1159 Common Subsequence(动态规划)
- HDU1159 Common Subsequence (LCS)
- HDU1159:Common Subsequence(LCS)
- hdu1159 Common Subsequence(LCS)
- Hdu1159-Common Subsequence-【LCS】
- hdu1159/poj1458 Common Subsequence 动态规划
- HDU1159 && POJ1458:Common Subsequence(LCS)
- HDU1159 && POJ1458:Common Subsequence(LCS)
- hdu1159 Common Subsequence(LCS)
- 【HDU1159】Common Subsequence(LCS/DP)
- HDU1159 Common Subsequence (LCS)
- HDU1159 && POJ1458 Common Subsequence (LCS)
- HDU1159 : Common Subsequence(LCS)
- HDU 1159 Common Subsequence (动态规划LCS)
- 【common subsequence】动态规划+回溯求LCS
- Common Subsequence(hdu1159(LCS))
- 文章标题
- Haar特征与积分图
- LeetCode-5 Longest Palindromic Substring
- 如何与接口合作方合作
- ios8不用越狱也可以快捷打开蜂窝
- Common Subsequence 杭电HDU1159 【动态规划LCS】
- IOS 获取所有图片工具类
- 仿微信按返回键app退到后台,并在通知栏里显示
- SQL 错误: ORA-00972: 标识符过长
- 为ElasticSearch添加HTTP基本认证(head,bigdesk等插件增加登陆机制)
- ImageUtils-图片工具类
- android 在代码中使用 #ffffff 模式 设置背景色
- O_APPEND的含义
- 图像处理与计算机视觉 基础、经典以及最近发展