【解题报告】uva10405_Longest Common Subsequence(最长公共子序列, dp)
来源:互联网 发布:新疆旅游数据 编辑:程序博客网 时间:2024/06/04 18:13
Problem C: Longest Common Subsequence
Sequence 1:
Sequence 2:
Given two sequences of characters, print the length of the longest common subsequence of both sequences. For example, the longest common subsequence of the following two sequences:
abcdghaedfhris adh of length 3.
Input consists of pairs of lines. The first line of a pair contains the first string and the second line contains the second string. Each string is on a separate line and consists of at most 1,000 characters
For each subsequent pair of input lines, output a line containing one integer number which satisfies the criteria stated above.
Sample input
a1b2c3d4ezz1yy2xx3ww4vvabcdghaedfhrabcdefghijklmnopqrstuvwxyza0b0c0d0e0f0g0h0i0j0k0l0m0n0o0p0q0r0s0t0u0v0w0x0y0z0abcdefghijklmnzyxwvutsrqpoopqrstuvwxyzabcdefghijklmn
Output for the sample input
432614
Problem Setter: Piotr Rudnicki
题目大意:
输入两个长度不相等且均不超过1000的字符串,求其最长公共子序列的长度。
解题思路:
基础动态规划,设输入的字符串分别为A、B。定义状态dp(i)(j),表示A串前i个字符与B串前j个字符的最长公共子序列的长度。
状态转移方程:dp(i)(j) = max{ dp(i-1)(j), dp(i)(j-1) | A[i]!=B[j] }
dp(i)(j) = max{ dp(i-1)(j), dp(i)(j-1), dp(i-1)(j-1)+1 | A[i]=B[j] }
注意输入的字符串中包含空格。
#include <cstdio>#include <cstring>#define max(a,b) (a>b?a:b)char A[1010];char B[1010];int dp[1010][1010];int main(){ //freopen("in.txt","r",stdin); while(gets(A+1) && gets(B+1)){////gets()的返回值是读入的字符串,错误返回NULL(0) memset(dp,0,sizeof(dp)); int lenA = strlen(A+1); int lenB = strlen(B+1); for(int i=1;i<=lenA;++i){ for(int j=1;j<=lenB;++j){ dp[i][j]=max(dp[i-1][j],dp[i][j-1]); if(A[i]==B[j]) dp[i][j]=max(dp[i][j],dp[i-1][j-1]+1); } } printf("%d\n",dp[lenA][lenB]); } return 0;}
- 【解题报告】uva10405_Longest Common Subsequence(最长公共子序列, dp)
- HDU 1159 Common Subsequence--DP--(最长公共子序列)
- HDU 1159 Common Subsequence(DP最长公共子序列)
- poj1458 Common Subsequence (dp,最长公共子序列)
- HDU 1159 Common Subsequence(最长公共子序列)dp
- 【HDU】1159 Common Subsequence(DP、最长公共子序列)
- Common Subsequence(最长公共子序列)
- TOJ 1683 Common Subsequence 最长公共子序列 依然DP
- hdu 1159 Common Subsequence(DP最长公共子序列)
- hdu1159 - Common Subsequence (dp 最长公共子序列问题)
- 最长公共子序列DP Common Subsequence HDU 1159
- poj 1458 Common Subsequence dp 最长公共子序列
- Common Subsequence经典DP,最长公共子序列
- 最长公共子序列(dp) & hdu 1159 Common Subsequence
- POJ 1458-Common Subsequence(dp之最长公共子序列)
- hdu 1159 Common Subsequence(最长公共子序列 DP)
- hdu1159 Common Subsequence 最长公共子序列 经典DP
- poj1458 Common Subsequence 最长公共序列 解题报告(附详细分析)
- 黑马程序员-Foundation框架-NSDictionary
- 卸载oracle
- struts2 + spring + mybatis 整合配置文件
- 数据类型之间的转换
- 黑马程序员-Foundation-NSValue
- 【解题报告】uva10405_Longest Common Subsequence(最长公共子序列, dp)
- Linux知识:/root/.bashrc与/etc/profile的异同
- repo使用过程中遇到的一些问题及解决办法
- 内心
- 2012山东大学校赛,高年级组【Problem F 一字棋 】
- 黑马程序员-总结
- 《社会性动物》备忘笔记
- Intent-filter 小解
- jemalloc