HDU--dp练习--1022--Common Subsequence
来源:互联网 发布:java基础电子书 编辑:程序博客网 时间:2024/06/03 04:44
题目:
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.
就是求两个字符串的最长公共子序列。
解题思路:
LCS问题。
状态转移方程:
dp[i][j] = dp[i - 1][j - 1] + 1; a[i - 1] == b [j - 1]
dp[i][j] = max (dp[i - 1][j],dp[i][j - 1]); a[i - 1] == b [j - 1]
参考博客:http://blog.csdn.net/dq_dm/article/details/45043689
源代码:
#include <bits/stdc++.h>
using namespace std;
int main()
{
string a,b;
while (cin >> a >> b)
{
int length_a = a.length();
int length_b = b.length();
int dp[length_a+1][length_b+1];
int i,j;
for (i = 0; i <= length_a; i++)
dp[i][0] = 0;
for (i = 0; i <= length_b; i++)
dp[0][i] = 0;
for (i = 1; i <= length_a; i++)
for (j = 1; j<= length_b; 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]);
}
// for (i = 0; i <= length_a; i++)
// {
// for (j = 0; j <= length_b; j++)
// cout << dp[i][j] << " " ;
// cout << endl;
// }
cout << dp[length_a][length_b] << endl;
}
return 0;
}
- HDU--dp练习--1022--Common Subsequence
- Common Subsequence HDU dp
- hdu 1159 Common Subsequence #DP
- hdu 1159 Common Subsequence (dp)
- HDU--1159 -- Common Subsequence [DP]
- hdu 1159 Common Subsequence(dp)
- HDU Common Subsequence (dp)
- HDU 1159 Common Subsequence (dp)
- Common Subsequence(dp)HDU 1159
- HDU 1159 Common Subsequence(还是DP)
- hdu 题目1159 Common Subsequence(DP)
- HDU 1159 Common Subsequence(DP,LCS)
- hdu 1159 Common Subsequence(LCS,dp)
- HDU 1159 Common Subsequence(dp LCS)
- HDU 1159 Common Subsequence (备忘录DP)
- hdu 1159 Common Subsequence(dp)
- hdu 1159 Common Subsequence (dp)
- Hdu oj 1159 Common Subsequence(dp)
- G
- jsonp问题
- 稳定排序
- XtraTabControl 控件使用
- 分主线程,子线程,访问是否连接网络
- HDU--dp练习--1022--Common Subsequence
- 网易云课堂JAVA入门编程题7-2
- Linux操作系统分区格式Ext2,Ext3,Ext4的区别
- baseUtil 数组之间转换,显示fragment 获取状态栏高度 等等。。
- Zookeeper集群配置
- 用龙芯1c库在RT-Thread下输出PWM
- 1757 A Simple Math Problem(矩阵快速幂入门)
- JavaWeb应用如何实现保持登录状态
- 信息交换