题目描述
Partychen has gone to the mall’s jewelry store and spies a charm bracelet. Of course, he’d like to fill it with the best charms possible from the N (1 ≤ N ≤ 3,402) available charms. Each charm i in the supplied list has a weight Wi (1 ≤ Wi ≤ 400), a ‘desirability’ factor Di (1 ≤ Di ≤ 100), and can be used at most once. partychen can only support a charm bracelet whose weight is no more than M (1 ≤ M ≤ 12,880).
Given that weight limit as a constraint and a list of the charms with their weights and desirability rating, deduce the maximum possible sum of ratings.
输入格式
The first line are two space-separated integers: N and M
The next N lines describes charm i with two space-separated integers: Wi and Di
输出格式
A single integer that is the greatest sum of charm desirabilities that can be achieved given the weight constraints
样例
input
4 6 1 4 2 6 3 12 2 7output
23 Hint: We choose 1 4,2 7,3 12,we can get the greatest sum 23.and the weight is 6.
思路:紫书272-273有专门的例题,最基础的多阶段决策问题。可以用二维数组解决,先枚举物品种类,再遍历可能的重量取值;也可以用一维数组解决,枚举方式相同,只是可以用一维数组保存历史信息。注:用二维数组时,枚举重量的顺序无影响(从大到小/从小到大),但用一维数组时必须用逆序(从大到小)。代码实现如下:
#include <iostream>
#include <cstring>
using namespace std;
int main()
{
int N, M;
long long w[5000], d[5000];
long long *dp = (long long*)malloc(130000*sizeof(long long));
memset(dp, 0, 130000*sizeof(long long));
cin>>N>>M;
for(int i=0; i<N; ++i)
cin>>w[i]>>d[i];
for(int i=0; i<N; ++i)
for(int j=M; j>=w[i]; --j)
dp[j] = max(dp[j], dp[j-w[i]] + d[i]);
cout<<dp[M]<<endl;
return 0;
}