baoshuo/OI-codes
baoshuo/OI-codes
0
1
Fork 0
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-23 20:28:48 +00:00
Code Releases Activity

2. 01背包问题

Browse Source 
https://www.acwing.com/problem/content/submission/code_detail/7078590/
This commit is contained in:
Baoshuo Ren 2021-08-12 15:54:21 +08:00 committed by Baoshuo Ren
parent 16385d9120
commit 266211ef37
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
AcWing/2/2.cpp
View File

@ -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;
} }