洛谷 1794.装备运输

思路：二费背包

其实就是有两个限制而已，其他的和01背包没有什么区别

#include<iostream>
#include<stdio.h>
#include<cstring>
#include<cstdlib>
#include<cmath> 
#include<vector>
#include<algorithm>
#include<stack>
#include<queue>
#include<deque>
#include <iomanip>
#include<sstream>
#include<numeric>
#include<map>
#include<limits.h>
#include<unordered_map>
#include<set>
#define MAX 1000
#define inf 0x3f3f3f3f
#define _for(i,a,b) for(int i=a;i<(b);i++)
using namespace std;
int V, G, n;
int g_[MAX];
int v_[MAX];
int values[MAX];
int dp[MAX][MAX];
int main()
{
    cin >> V >> G;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> values[i] >> v_[i] >> g_[i];
    }
    for(int i=0;i<n;i++){
        for (int j = G; j >= g_[i]; j--) {
            for (int k = V; k >= v_[i]; k--) {
                dp[j][k] = max(dp[j][k], dp[j - g_[i]][k - v_[i]] + values[i]);
            }
        }
    }
    cout<<dp[G][V];
    return 0;
}