P1509 找啊找啊找GF(二维01背包变形)-优快云博客

本文介绍了一种使用动态规划解决背包问题的方法，旨在通过优化选择物品的策略来最大化背包的价值，同时考虑了物品价值、重量及背包容量的限制。

#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000005;
const int INF = 0x3f3f3f3f;
#define reg register
#define IOS ios::sync_with_stdio(false)

int n;
int m, r;
int tme[1002];
int rp[1002];
int rmb[1002];
int dptime[1005][1005];
int dpMM[1005][1005];

int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		scanf("%d %d %d", rmb + i, rp + i, tme + i);
	}
	scanf("%d %d", &m, &r);
	for (int i = 1; i <= n; i++) {
		for (int j = m; j >= rmb[i]; j--) {
			for (int k = r; k >= rp[i]; k--) {
				if (dpMM[j][k] < dpMM[j - rmb[i]][k - rp[i]] + 1) {
					dpMM[j][k] = dpMM[j - rmb[i]][k - rp[i]] + 1;
					dptime[j][k] = dptime[j - rmb[i]][k - rp[i]] + tme[i];
				} else if (dpMM[j][k] == dpMM[j - rmb[i]][k - rp[i]]+1) {
					dptime[j][k] = min(dptime[j][k], dptime[j - rmb[i]][k - rp[i]] + tme[i]);
				}
			}
		}
	}
	printf("%d", dptime[m][r]);
	return 0;
}