动态规划学习与实例(1)
动态规划求解思路:
- 分解最优子结构
- 找出各级最优子结构间递推关系
- 自底向上求解最优子结构表
- 追溯到最优解
示例:
Problem1. 给定一个数字序列,找出其中最长子序列,子序列满足顺序递增。求解最长子序列的长度和对应的子序列。
Problem2. 给定一个数字序列,找出其中和最大的子序列,并求解子序列的长度和对应的子序列。
分析
Problem1
- 最长递增子序列的最优子结构:假设长度从
1
到
i 的序列中,以 a[i] 结尾的最优子序列对应的长度为 opt[i] . i=1:n 时依次得到最优子结构表. - 递推关系
opt[i]={1opt[i−1]i=1 or a[i] < a[i-1] (i>1)a[i] ≥ a[i-1] (i>1)
- and 4. 见C++代码
Problem2
- 和最大子序列的最优子结构:假设长度从
1
到
i 的序列中,以 a[i] 结尾的最优子序列对应的和为 opt[i] . i=1:n 时依次得到最优子结构表. - 递推关系
opt[i]={a[1]max{opt[i−1]+a[i],a[i]}i=1i>1 - and 4. 见C++代码
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Maxstr
{
vector<double> seq;
public:
Maxstr();
Maxstr(vector<double> seq1);
~Maxstr();
void calc(vector<double> & maxseq, int & n);
void calc2(vector<double> & maxseq, double & n);
};
Maxstr::Maxstr()
{
for(int i=0; i<seq.size(); i++)
{
seq.at(i) = 0;
}
}
Maxstr::Maxstr(vector<double> seq1)
{
seq = seq1;
}
Maxstr::~Maxstr()
{
}
//calc函数求给定序列的最大递增子序列,子序列保存在maxseq,长度为n
void Maxstr::calc(vector<double> & maxseq, int & n)
{
vector<int> opt(seq.size());
opt.at(0)=1;
n = opt.at(0);
int end;
for (int i = 1; i<opt.size(); ++i)
{
if (seq.at(i)<seq.at(i-1))
{
opt.at(i)=1;
}
else
{
opt.at(i)=opt.at(i-1) + 1;
if (n < opt.at(i))
{
n = opt.at(i);
end = i;
}
}
}
maxseq.resize(n);
for (int j=n-1; j>=0; --j)
{
maxseq.at(n-j-1) = seq.at(end-j);
}
}
//clac2求给定序列的最大和子序列,子序列保存在maxseq,和为sum
void Maxstr::calc2(vector<double> & maxseq, double & sum)
{
int end;
vector<double> opt(seq.size());
opt.at(0)=seq.at(0);
sum = 0;
for (int i = 1; i<opt.size(); ++i)
{
if (opt.at(i-1)<=0)
{
opt.at(i) = seq.at(i);
}
else
{
opt.at(i)=opt.at(i-1) + seq.at(i);
}
if(sum<opt.at(i))
{
end = i;
sum=opt.at(i);
}
}
maxseq.clear();
double temp = sum;
for (int j=end; j>=0 && temp !=0; --j)
{
temp -= seq.at(j);
maxseq.push_back(seq.at(j));
}
reverse(maxseq.begin(), maxseq.end());
}
//主函数测试类和动态规划算法
int main()
{
double arr[] = {7, -1, 2, 3, 11, 8, 11, -17, 12};
vector<double> seq(arr, arr+9);
Maxstr ms(seq);
vector<double> maxseq1;
vector<double> maxseq2;
int n;
double sum;
ms.calc(maxseq1, n);
ms.calc2(maxseq2, sum);
cout<<"n = "<<n<<endl;
for (int i=0; i<maxseq1.size(); ++i)
{
cout<<maxseq1.at(i)<<" ";
}
cout<<endl;
cout<<"sum = "<<sum<<endl;
for (int i=0; i<maxseq2.size(); ++i)
{
cout<<maxseq2.at(i)<<" ";
}
cout<<endl;
return 0;
}