wxy/lanqiao
1
1
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

lanqiao 2223 背包与魔法

Browse Source
This commit is contained in:
xingyou
2025-04-09 12:40:09 +08:00
parent e81e71b95f
commit cb4b4332b8
1 changed files with 4 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
00lanqiao chap/test100-1-3.cpp
View File

@@ -12,10 +12,11 @@ signed main()
int w, v; cin >> w >> v; int w, v; cin >> w >> v;
for(int j = m; j >= 0; j--){ for(int j = m; j >= 0; j--){
if(j >= w){ if(j >= w){
dp[j][0] = max(dp[j][0], dp[j-w][0] + v); dp[j][0] = max(dp[j][0], dp[j-w][0] + v); // 未使用魔法
dp[j][1] = max(dp[j][1], dp[j-w][1] + v); dp[j][1] = max(dp[j][1], dp[j-w][1] + v); // 可以使用魔法, 但不是本次
} }
if(j >= (w+k)) dp[j][1] = max(dp[j][1], dp[j-w-k][0] + 2*v); // 使用魔法, 但必须从未使用魔法状态转移, 否则会导致多次使用魔法
if(j >= (w+k)) dp[j][1] = max(dp[j][1], dp[j-w-k][0] + 2*v);
} }
} }
cout << max(dp[m][1], dp[m][0]) << '\n'; cout << max(dp[m][1], dp[m][0]) << '\n';