hdoj 5410 CRB and His Birthday 【0-1背包 + 完全背包】

CRB and His Birthday

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)

Total Submission(s): 1083    Accepted Submission(s): 545

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

  
  

   
   1
100 2
10 2 1
20 1 1
  
  

 

Sample Output

  
  

   
   21

   
   

    
    

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

 

题意：有n个物品和m元钱，已知每个物品的价格W[]，和购买k个物品得到的价值A[] * k+ b[]。现在问你能够得到的最大价值。

思路：用0-1背包决策出第一次选取物品，价值为A[] + B[]，然后就是完全背包了，价值叠加A[]。

AC代码：

#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#define INF 0x3f3f3f
#define eps 1e-4
#define MAXN (2000+10)
#define MAXM (100000)
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rf(a) scanf("%lf", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pf(a) printf("%.2lf\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while(a--)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define LL long long
#define lson o<<1, l, mid
#define rson o<<1|1, mid+1, r
#define ll o<<1
#define rr o<<1|1
using namespace std;
int A[MAXN], B[MAXN], W[MAXN];
int dp[MAXN];
int main()
{
    int t; Ri(t);
    W(t)
    {
        int M, N;
        Ri(M); Ri(N);
        for(int i = 1; i <= N; i++)
            Ri(W[i]), Ri(A[i]), Ri(B[i]);
        CLR(dp, 0);
        for(int i = 1; i <= N; i++)
        {
            for(int j = M; j >= W[i]; j--)
                dp[j] = max(dp[j], dp[j-W[i]]+B[i]+A[i]);
            for(int j = W[i]; j <= M; j++)
                dp[j] = max(dp[j], dp[j-W[i]]+A[i]);
        }
        Pi(dp[M]);
    }
    return 0;
}