下面这篇博文讲述的原理浅显易懂,但是他没有输出哪些被选择了。
http://blog.renren.com/share/228709498/2675290555
本文在这一篇的基础上进行改进:重构被选择的金矿。
矩阵 maxGold[people][goldIndex] 行序号people表示给的总人数,列序号表示挖在前 goldIndex 个金矿里选择挖哪几个。
关键点:
maxGold[peopletotaltemp][gTemp] == maxGold[peopleCut][gTemp - 1] + gold[gTemp]
则 第 gTemp 个金矿被挖!
详细见下面的代码!
#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
const int max_n = 100;//程序支持的最多金矿数
const int max_people = 10000;//程序支持的最多人数
int n;//金矿数
int peopleTotal;//可以用于挖金子的人数
int peopleNeed[max_n];//每座金矿需要的人数
int gold[max_n];//每座金矿能够挖出来的金子数
int maxGold[max_people][max_n];//maxGold[i][j]保存了i个人挖前j个金矿能够得到的最大金子数,等于-1时表示未知
//int goldSelect[max_n] = { 0 };
int select[max_n] = { 0 }; // 记录被选择的金山 ,选择记为 1
void init()
{
ifstream inputFile("inputFile.txt");
inputFile >> peopleTotal >> n;
for (int i = 0; i<n; i++)
inputFile >> peopleNeed[i] >> gold[i];
inputFile.close();
for (int i = 0; i <= peopleTotal; i++)
for (int j = 0; j<n; j++)
maxGold[i][j] = -1; //等于-1时表示未知 [对应动态规划中的“做备忘录”]
}
// 重构被选择的金山
void reConstructSel()
{
int peopletotaltemp = peopleTotal; // 200
int gTemp = n - 1; // 从 0 开始标序号
int peopleCut;;
while (gTemp >= 0 && peopletotaltemp> 0)
{
peopleCut = peopletotaltemp - peopleNeed[gTemp];
// 检查当前 金山是否被挖了,如果被挖了,则 wtemp = peopleCut; gTemp--; 否则 gTemp--;
if (maxGold[peopletotaltemp][gTemp] == maxGold[peopleCut][gTemp - 1] + gold[gTemp])
{
select[gTemp] = 1;
peopletotaltemp = peopleCut;
}
gTemp--;
}
}
void printRes()
{
int count = 0;
ofstream output("outFile.txt");
for (int people = 0; people <= peopleTotal; people++)
{
for (int goldIndex = 0; goldIndex < n; goldIndex++)
{
output << maxGold[people][goldIndex] << " ";
}
output << endl;
}
output << "被先择的金山 : " << endl;
for (int gIndex = 0; gIndex < n; gIndex++)
{
if (select[gIndex])
{
count++;
output << gIndex << " : " << gold[gIndex] << endl;
}
}
output << "一共选择 " << count << "个金山 , 总金书为 " << maxGold[peopleTotal][n - 1] << endl;
}
int GetMaxGold(int peopleLeft, int goldHillLeft)
{
int retMaxGold = 0; // 返回值
int maxGoldTemp = maxGold[peopleLeft][goldHillLeft];
int peopleTemp;
if (maxGoldTemp != -1) // 已经求过
{
retMaxGold = maxGold[peopleLeft][goldHillLeft];
}
else
{
if (goldHillLeft == 0) // 最后一个金山了
{
peopleTemp = peopleNeed[goldHillLeft];
if (peopleLeft >= peopleNeed[goldHillLeft])
{
retMaxGold = gold[0];
}
else
{
retMaxGold = 0;
}
}
else
{
peopleTemp = peopleNeed[goldHillLeft];
if (peopleLeft >= peopleTemp)
{
int goldTemp = gold[goldHillLeft];
int isSelect;
int notSelect;
isSelect = goldTemp + GetMaxGold(peopleLeft - peopleTemp, goldHillLeft - 1);
notSelect = GetMaxGold(peopleLeft, goldHillLeft - 1);
retMaxGold = isSelect >= notSelect ? isSelect : notSelect;
}
else
{
retMaxGold = GetMaxGold(peopleLeft, goldHillLeft - 1);
}
}
maxGold[peopleLeft][goldHillLeft] = retMaxGold;
}
return retMaxGold;
}
int main()
{
//初始化数据
init();
GetMaxGold(peopleTotal, n - 1);
reConstructSel();
// 结果输出
printRes();
system("pause");
return 0;
}