hdu【1159】Common Subsequence 【最长公共子序列】
来源:互联网 发布:PHP如何实现双向队列 编辑:程序博客网 时间:2024/06/05 00:28
Common Subsequence
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 the std input. Each data set in the input 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.
abcfbc abfcabprogramming contest abcd mnp
420
#include<cstdio>#include<cstring>#include<stack>#include<algorithm>using namespace std;char str1[10001];//main函数里面定义太小,容易越界 char str2[10001];int dp[10001][10001] = {0};int main(){while(~scanf ("%s%s",str1+1,str2+1)){str1[0] = str2[0] = '0';int l1 = strlen(str1)-1;int l2 = strlen(str2)-1;int i,j;for ( i = 1 ; i <= l1 ; i++){for (j = 1 ; j <= l2 ; j++){if (str1[i] == str2[j]) //dp[i-1][j-1]+1 str1[i]==str2[j]dp[i][j] = dp[i-1][j-1] + 1;elsedp[i][j] = max(dp[i-1][j],dp[i][j-1]);//max(dp[i-1][j],dp[i][j-1]) str1[i]!=str2[j]}}printf("%d\n",dp[l1][l2]);}return 0;}
阅读全文
1 0
- HDU Common Subsequence 最长公共子序列
- HDU Common Subsequence(最长公共子序列)
- hdu 1159 Common Subsequence ***poj1458(最长公共子序列)
- hdu 1159 Common Subsequence 最长公共子序列
- hdu 1159 Common Subsequence(DP最长公共子序列)
- HDU 1159 Common Subsequence 最长公共子序列
- HDU 1159 Common Subsequence--最长公共子序列
- hdu 1159 Common Subsequence (最长公共子序列)
- Common Subsequence 最长公共子序列 hdu 1159
- hdu 1159 Common Subsequence(LCS最长公共子序列)
- hdu 1159 Common Subsequence(最长公共子序列)
- hdu 1159 Common Subsequence(动态规划:最长公共子序列)
- HDU 1159 Common Subsequence (动规+最长公共子序列)
- HDU 1159:Common Subsequence(最长公共子序列)
- 最长公共子序列DP Common Subsequence HDU 1159
- hdu 1159 Common Subsequence(最长公共子序列)
- HDU 1159 Common Subsequence(最长公共子序列)
- HDU 1159 Common Subsequence(最长公共子序列)
- 01 背包 完全背包 多重背包 三件套(这三个背包 想要吗?)
- Supervisor配置文件详解
- How to install codeblocks in RedHat without root authority
- 01背包 初学篇
- 计算机图形学
- hdu【1159】Common Subsequence 【最长公共子序列】
- J-03. Web 登录 ❀ 瞻博 (Juniper) 防火墙
- MyBatis教程之四多表关系的实现
- jconsole连接远程服务
- shrink space
- 这些数据获取方式,一般人不告诉他
- 《信息检索导论》(第五章)索引压缩
- [leetcode] 50. Pow(x, n)
- 实习总结1