LDUOJ 1586. 【吴永辉】程序设计基础实践7-9 M. Charm Bracelet

M. Charm Bracelet

问题描述

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≤3402) 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

输出

A single integer that is the greatest sum of charm desirabilities that can be achieved given the weight constraints

样例：

输入：

4 6
1 4
2 6
3 12
2 7

输出：

23

题目描述：标准的01背包问题
记得把dp数组的最大值开到大于12880

代码：

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e6;
int w[maxn],v[maxn],dp[maxn];
int main() {
	int n,m;
	cin>>n>>m;
	for(int i=1; i<=n; i++) cin>>w[i]>>v[i];
	for(int i=1; i<=n; i++)//遍历n个魅力值 
		for(int j=m; j>=w[i]; j--) //逆序遍历 01背包 
				dp[j]=max(dp[j],dp[j-w[i]]+v[i]);
    //dp[j]=dp[j] 第i个魅力值不加  dp[j]=dp[j-w[i]]+v[i]] 第i个魅力值加 
	cout<<dp[m];

	return 0;
}
}

题目链接