mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-11-08 13:58:48 +00:00
4. 多重背包问题 I
https://www.acwing.com/problem/content/submission/code_detail/13023621/
This commit is contained in:
parent
85b2bbae8e
commit
a189995d60
35
AcWing/4/4.cpp
Normal file
35
AcWing/4/4.cpp
Normal file
@ -0,0 +1,35 @@
|
|||||||
|
#include <iostream>
|
||||||
|
|
||||||
|
using std::cin;
|
||||||
|
using std::cout;
|
||||||
|
const char endl = '\n';
|
||||||
|
|
||||||
|
const int N = 505,
|
||||||
|
M = 6005;
|
||||||
|
|
||||||
|
int n, m, v[N], w[N], s[N], f[M], ans;
|
||||||
|
|
||||||
|
int main() {
|
||||||
|
std::ios::sync_with_stdio(false);
|
||||||
|
|
||||||
|
cin >> n >> m;
|
||||||
|
for (int i = 1; i <= n; i++) {
|
||||||
|
cin >> v[i] >> w[i] >> s[i];
|
||||||
|
}
|
||||||
|
|
||||||
|
for (int i = 1; i <= n; i++) {
|
||||||
|
for (int k = 1; k <= s[i]; k++) {
|
||||||
|
for (int j = m; j >= v[i]; j--) {
|
||||||
|
f[j] = std::max(f[j], f[j - v[i]] + w[i]);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
for (int i = 0; i <= m; i++) {
|
||||||
|
ans = std::max(ans, f[i]);
|
||||||
|
}
|
||||||
|
|
||||||
|
cout << ans << endl;
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
Loading…
Reference in New Issue
Block a user