B. CRB and His Birthday
Time Limit: 1000ms
Memory Limit: 65536KB
64-bit integer IO format:
%I64d Java class name:
Main
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 $W_{i}$ Won to buy one present of $i$-th kind. (So it costs $k$ × $W_{i}$ Won to buy $k$ of them.)
But as the counter of the shop is her friend, the counter will give $A_{i}\ ×\ x\ +\ B_{i}$ 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 ≤ $A_{i},\ B_{i}$ ≤ 2000
1 ≤ $W_{i}$ ≤ 2000
She went to the nearest shop with $M$ Won(currency unit).
At the shop, there are $N$ kinds of presents.
It costs $W_{i}$ Won to buy one present of $i$-th kind. (So it costs $k$ × $W_{i}$ Won to buy $k$ of them.)
But as the counter of the shop is her friend, the counter will give $A_{i}\ ×\ x\ +\ B_{i}$ 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 ≤ $A_{i},\ B_{i}$ ≤ 2000
1 ≤ $W_{i}$ ≤ 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 $W_{i}$, $A_{i}$ and $B_{i}$.
The first line contains two integers $M$ and $N$.
Then $N$ lines follow, $i$-th line contains three space separated integers $W_{i}$, $A_{i}$ and $B_{i}$.
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
题意:你有M块钱,现在有N件商品
第i件商品要Wi块,如果你购买x个这样的商品,你将得到Ai*x+Bi个糖果
问能得到的最多的糖果数
思路:非常好的一道01背包和完全背包结合的题目
首先,对于第i件商品,如果只买1个,得到的价值是Ai+Bi
如果在买1个的基础上再买,得到的价值就是Ai,也就是,买一个糖果为1*a[i]+b[i],买两个为2*a[i]+b[i],就相比第一个多了a[i]
也就是说,除了第一次是Ai+Bi,以后购买都是Ai
那么,我们能否将i商品拆分成两种商品,其中两种商品的代价都是Wi,
第一种的价值是Ai+Bi,但是只允许买一次
第二种的价值是Ai,可以无限次购买
接下来我们来讨论这样拆的正确性
理论上来讲,买第二种之前,必须要买第一种
但是对于这道题,由于Ai+Bi>=Ai是必然的,因为Bi肯定是非负
所以对于代价相同,价值大的肯定会被先考虑
换句话来说,如果已经开始考虑第二种商品了,那么第一种商品就肯定已经被添加到背包里了~
所以,这题我们把n件商品拆分成2*n件商品,对于第一种商品做01背包,对于第二种商品做完全背包,这样就把题目转换成了非常熟悉的题目,也就能顺利AC了
#include<stdio.h> #include<iostream> #include<string.h> using namespace std; struct node { int w,a,b; }s[10000]; int dp[10000]; int main() { int t; scanf("%d",&t); while(t--) { memset(dp,0,sizeof(dp)); int n,m; scanf("%d%d",&n,&m); for(int i=0;i<m;i++) { scanf("%d%d%d",&s[i].w,&s[i].a,&s[i].b); } for(int i=0;i<m;i++)//先01背包跑数量为1且价值为s[i].a*1+s[i].b物品 { for(int j=n;j>=s[i].w;j--) { dp[j]=max(dp[j],dp[j-s[i].w]+s[i].a*1+s[i].b); } } for(int i=0;i<m;i++)//再完全背包,跑价值为s[i].a的可能取多个的物品 { for(int j=s[i].w;j<=n;j++) { dp[j]=max(dp[j-s[i].w]+s[i].a,dp[j]); } } printf("%d\n",dp[n]); } }