3142: 动态规划进阶题目之Charm Bracelet
时间限制: 1 Sec 内存限制: 64 MB
提交: 147 解决: 85
[提交][状态][讨论版][命题人:lyh]
题目描述
Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'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. Bessie 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.
输入
* Line 1: Two space-separated integers: N and M
* Lines 2..N+1: Line i+1 describes charm i with two space-separated integers: Wi and Di
输出
* Line 1: A single integer that is the greatest sum of charm desirabilities that can be achieved given the weight constraints
样例输入
copy
4 6
1 4
2 6
3 12
2 7
样例输出
23
提示
01背包问题,需要使用滚动数组进行优化,不然内存超限。
来源
#include<iostream>
#include<algorithm>//writen by Bu Lingchao from YanTai University
using namespace std;
int weight[3410],value[3410];
int dp[12890];
int main(){
int n,m;
cin>>n>>m;
for(int i = 0;i < n;i ++){
cin>>weight[i]>>value[i];
for(int j = m;j >= weight[i];j --){
dp[j] = max(dp[j],dp[j-weight[i]]+value[i]);
}
}
cout<<dp[m];
return 0;
}