Day11（背包入门）

01背包

w[i]—物品的重量
v[i]—物品的价值
dp[i][j]–前i个物品装入容量为j的背包里面能获得的最大价值
dp[i][j]=max(dp[i-1][j],dp[i-1][j-w[i]]+v[i])

例题-湫湫系列故事——减肥记I
　　对于吃货来说，过年最幸福的事就是吃了，没有之一！
　　但是对于女生来说，卡路里（热量）是天敌啊！
　　资深美女湫湫深谙“胖来如山倒，胖去如抽丝”的道理，所以她希望你能帮忙制定一个食谱，能使她吃得开心的同时，不会制造太多的天敌。

当然，为了方便你制作食谱，湫湫给了你每日食物清单，上面描述了当天她想吃的每种食物能带给她的幸福程度，以及会增加的卡路里量。

Input
输入包含多组测试用例。
每组数据以一个整数n开始，表示每天的食物清单有n种食物。
接下来n行，每行两个整数a和b，其中a表示这种食物可以带给湫湫的幸福值（数值越大，越幸福），b表示湫湫吃这种食物会吸收的卡路里量。
最后是一个整数m，表示湫湫一天吸收的卡路里不能超过m。

[Technical Specification]

1. 1 <= n <= 100
2. 0 <= a,b <= 100000
3. 1 <= m <= 100000

Output
对每份清单，输出一个整数，即满足卡路里吸收量的同时，湫湫可获得的最大幸福值。

Sample Input

3
3 3
7 7
9 9
10
5
1 1
5 3
10 3
6 8
7 5
6

Sample Output

10
20

ac代码

#include <bits/stdc++.h>
using namespace std;
const int maxn=1e5+10;
long long v[maxn];
long long w[maxn];
long long dp[maxn];
int main()
{
	int n,m;
	while(cin>>n)
	{
		for(int i=1;i<=n;i++) cin>>v[i]>>w[i];
		cin>>m;
		memset(dp,0,sizeof dp);
		for(int i=1;i<=n;i++)
		{
			for(int j=w[i];j<=m;j++)
			{
				dp[j]=max(dp[j],dp[j-w[i]]+v[i]);
			}
		}
		cout<<dp[m]<<endl;
	}
}

完全背包

dp[i][j]=max(dp[i-1][j],dp[i][j-w[i]]+v[i])

例题-Bone Collector
Many years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave …
The bone collector had a big bag with a volume of V ,and along his trip of collecting there are a lot of bones , obviously , different bone has different value and different volume, now given the each bone’s value along his trip , can you calculate out the maximum of the total value the bone collector can get ?

Input
The first line contain a integer T , the number of cases.
Followed by T cases , each case three lines , the first line contain two integer N , V, (N <= 1000 , V <= 1000 )representing the number of bones and the volume of his bag. And the second line contain N integers representing the value of each bone. The third line contain N integers representing the volume of each bone.

Output
One integer per line representing the maximum of the total value (this number will be less than 2³¹).

Sample Input

1
5 10
1 2 3 4 5
5 4 3 2 1

Sample Output

14

ac代码

#include <bits/stdc++.h>
using namespace std;
const int maxn=1e5+10;
long long v[maxn];
long long w[maxn];
long long dp[maxn];
int main()
{
	int n,m,t;
	cin>>t;
	while(t--)
	{
		cin>>n>>m;
		for(int i=0;i<n;i++) cin>>v[i];
		for(int i=0;i<n;i++) cin>>w[i];
		memset(dp,0,sizeof dp);
		for(int i=0;i<n;i++)
		{
			for(int j=m;j>=w[i];--j)
			{
				dp[j]=max(dp[j],dp[j-w[i]]+v[i]);
			}
		}
		cout<<dp[m]<<endl;
	}
}