mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-11-08 12:58:48 +00:00
2. 01背包问题
https://www.acwing.com/problem/content/submission/code_detail/7078590/
This commit is contained in:
parent
16385d9120
commit
266211ef37
@ -2,7 +2,7 @@
|
|||||||
|
|
||||||
using namespace std;
|
using namespace std;
|
||||||
|
|
||||||
int n, m, v[1005], w[1005], f[1005][1005];
|
int n, m, v[1005], w[1005], f[1005];
|
||||||
|
|
||||||
int main() {
|
int main() {
|
||||||
cin >> n >> m;
|
cin >> n >> m;
|
||||||
@ -10,10 +10,10 @@ int main() {
|
|||||||
cin >> v[i] >> w[i];
|
cin >> v[i] >> w[i];
|
||||||
}
|
}
|
||||||
for (int i = 1; i <= n; i++) {
|
for (int i = 1; i <= n; i++) {
|
||||||
for (int j = 0; j <= m; j++) {
|
for (int j = m; j >= v[i]; j--) {
|
||||||
f[i][j] = max(f[i - 1][j], j >= v[i] ? f[i - 1][j - v[i]] + w[i] : f[i - 1][j]);
|
f[j] = max(f[j], f[j - v[i]] + w[i]);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
cout << f[n][m] << endl;
|
cout << f[m] << endl;
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
Loading…
Reference in New Issue
Block a user