hdu 5410 CRB and His Birthday（01 背包+多重背包）-CSDN博客

本文链接：https://blog.csdn.net/xiaosshhaa/article/details/62237392

Problem Description

Today is CRB's birthday. His mom decided to buy many presents for her lovely son.
She went to the nearest shop with

M Won(currency unit).
At the shop, there are

N kinds of presents.
It costs

Wi Won to buy one present of

i -th kind. (So it costs

k ×

Wi Won to buy

k of them.)
But as the counter of the shop is her friend, the counter will give

Ai × x + Bi candies if she buys

x (

x >0) presents of

i -th kind.
She wants to receive maximum candies. Your task is to help her.
1 ≤

T ≤ 20
1 ≤

M ≤ 2000
1 ≤

N ≤ 1000
0 ≤

Ai, Bi ≤ 2000
1 ≤

Wi ≤ 2000

Input

There are multiple test cases. The first line of input contains an integer

T , indicating the number of test cases. For each test case:
The first line contains two integers

M and

N .
Then

N lines follow,

i -th line contains three space separated integers

Wi ,

Ai and

Bi .

Output

For each test case, output the maximum candies she can gain.

Sample Input

Sample Output

  
  
   
   21

   
   
    
    
     
     Hint
    
    CRB's mom buys 10 presents of first kind, and receives 2 × 10 + 1 = 21 candies.

我感觉我应该好好读题，好好理解题意的，不然到最后浪费了时间

题意是：输入M,N分别表示钱的总数，和物品的种数，接下来的N行有三个数，w,a,b分别表示单价买一个糖送的糖，来买一次糖果送的糖果，求M个现金最多买到多少的糖

参考：点击打开链接

首先考虑b[i]存在的情况，b[i]只会出现在第一次购买商品的时候用上，用01背包处理，然后01背包处理完后，接着跑一遍多重背包，这次仅考虑a[i]对最终结果的影响，最终输出dp[m]即为最终结果。
为什么可以这样呢？因为01背包仅仅是考虑第一次买的情况，在01背包之后跑多重背包，状态是建立在01背包的基础之上，而这正是我们需要的状态。。。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int dp[2005];
int val[1005];
int a[1005],b[1005];
int main()
{
    int T;
    int n,m;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&m,&n);
        memset(dp,0,sizeof(dp));
        for(int i = 1; i <= n; i++)
            scanf("%d%d%d",&val[i],&a[i],&b[i]);
        for(int i = 1; i <= n; i++)// 0-1背包
            for(int j = m; j >= val[i]; j--)
                dp[j] = max(dp[j],dp[j-val[i]]+a[i]+b[i]);
        for(int i = 1; i <= n; i++)//多重背包
            for(int j = val[i]; j <= m; j++)
                dp[j] = max(dp[j],dp[j-val[i]]+a[i]);
        printf("%d\n",dp[m]);
    }
    return 0;
}