[USACO09DEC]视频游戏的麻烦Video Game Troubles（DP）

https://www.luogu.org/problem/P2967

https://ac.nowcoder.com/acm/contest/1077/B

题目描述

Farmer John's cows love their video games! FJ noticed that after playing these games that his cows produced much more milk than usual, surely because contented cows make more milk.
The cows disagree, though, on which is the best game console. One cow wanted to buy the Xbox 360 to play Halo 3; another wanted to buy the Nintendo Wii to play Super Smash Brothers Brawl; a third wanted to play Metal Gear Solid 4 on the PlayStation 3. FJ wants to purchase the set of game consoles (no more than one each) and games (no more than one each -- and within the constraints of a given budget) that helps his cows produce the most milk and thus nourish the most children.
FJ researched N (1 <= N <= 50) consoles, each with a console price Pi (1 <= Pi <= 1000) and a number of console-specific games Gi (1 <= Gi <= 10). A cow must, of course, own a console before she can buy any game that is specific to that console. Each individual game has a game price GPj (1 <= GPj price <= 100) and a production value (1 <= PVj <= 1,000,000), which indicates how much milk a cow will produce after playing the game. Lastly, Farmer John has a budget V (1 <= V <= 100,000) which is the maximum amount of money he can spend. Help him maximize the sum of the production values of the games he buys.

Consider one dataset with N=3 consoles and a V=$800 budget. The first console costs $300 and has 2 games with cost $30 and $25 and production values as shown:
    Game #    Cost    Production Value
      1       $30          50
      2       $25          80

The second console costs $600 and has only 1 game:
    Game #    Cost    Production Value
      1       $50          130

The third console costs $400 and has 3 games:
    Game #    Cost    Production Value
      1       $40         70
      2       $30         40
      3       $35         60

Farmer John should buy consoles 1 and 3, game 2 for console 1, and games 1 and 3 for console 3 to maximize his expected production at 210:
                                Production Value
        Budget:     $800      
        Console 1  -$300
           Game 2   -$25              80
        Console 3  -$400
           Game 1   -$40              70
           Game 3   -$35              60
      -------------------------------------------
        Total:         0 (>= 0)      210

题意翻译

农夫约翰的奶牛们打游戏上瘾了！本来约翰是想要按照调教兽的做法拿她们去电击戒瘾的，可后来他发现奶牛们玩游戏之后比原先产更多的奶。很明显，这是因为满足的牛会产更多的奶。

但是，奶牛们因何者为最好的游戏主机而吵得不可开交。约翰想要在给定的预算内购入一些游戏平台和一些游戏，使他的奶牛们生产最多的奶牛以养育最多的小牛。

约翰考察了

农夫约翰的预算为

样例说明 1

假设现在有

游戏编号
1	$30	50
2	$25	80

第二种主机的售价为

游戏编号
1	$50	130

第二种主机的售价为

游戏编号
1	$40	70
2	$30	40
3	$35	60

理想方案：

                              产量
           预算:    $800      
           主机 1  -$300
           游戏 2   -$25       80
           主机 3  -$400
           游戏 1   -$40       70
           游戏 3   -$35       60
      -------------------------------------------
          总和：   0 (≥ 0)     210

输入描述:

* Line 1: Two space-separated integers: N and V
* Lines 2..N+1: Line i+1 describes the price of and the games ?available for console i; it contains: Pi, Gi, and Gi pairs of space-separated integers GPj, PVj

输出描述:

* Line 1: The maximum production value that Farmer John can get with his budget.

示例1

输入

3 800 
300 2 30 50 25 80 
600 1 50 130 
400 3 40 70 30 40 35 60

输出

 1 #include <stdio.h>
 2 #include <string.h>
 3 #include <iostream>
 4 #include <string>
 5 #include <math.h>
 6 #include <algorithm>
 7 #include <vector>
 8 #include <queue>
 9 #include <set>
10 #include <map>
11 #include <math.h>
12 const int INF=0x3f3f3f3f;
13 typedef long long LL;
14 const int mod=1e9+7;
15 const double PI=acos(-1);
16 const int maxn=100010;
17 using namespace std;
18 //ios::sync_with_stdio(false);
19 //    cin.tie(NULL);
20 
21 int n,v;
22 int DP[55][100010];
23 
24 int main()
25 {
26     scanf("%d %d",&n,&v);
27     for(int i=1;i<=n;i++)
28     {
29         int cost,num;
30         scanf("%d %d",&cost,&num);
31         for(int j=cost;j<=v;j++)
32             DP[i][j]=DP[i-1][j-cost];//买了i个平台剩下j元 （j-cost）为买其他剩的钱
33         for(int k=1;k<=num;k++)//遍历每种游戏
34         {
35             int a,b;
36             scanf("%d %d",&a,&b);
37             for(int j=v;j>=cost+a;j--)
38                 DP[i][j]=max(DP[i][j],DP[i][j-a]+b);//一维01背包问题
39         }
40         for(int j=0;j<=v;j++)
41             DP[i][j]=max(DP[i][j],DP[i-1][j]);//重新判断一次,判断这个平台到底是买还是不买更值
42     }
43     printf("%d",DP[n][v]);
44     return 0;
45 }

一些题解：

https://www.cnblogs.com/hkpls/p/9908869.html

https://ac.nowcoder.com/acm/contest/view-submission?submissionId=41148893

https://www.cnblogs.com/Xxzxx/p/11336946.html

https://www.cnblogs.com/pile8852/p/9280310.html

https://blog.csdn.net/weixin_33835690/article/details/93431150

原文地址：https://www.cnblogs.com/jiamian/p/11386506.html