01背包问题,无论失败还是胜利都加经验,失败不消耗武器数量
- #include
- using namespace std;
- using ll = long long;
- const int N = 1e6 + 9;
- ll dp[N], win[N], lose[N], use[N];
-
- void solve()
- {
- ll n, x; cin >> n >> x;
- for (ll i = 1; i <= n; ++i)cin >> lose[i] >> win[i] >> use[i];
-
- for (ll i = 1; i <= n; ++i)
- {
- for (ll j = x; j >= 0; --j)
- {
- if (j >= use[i]) dp[j] = max(dp[j] + lose[i], dp[j - use[i]] + win[i]);
- else dp[j] = dp[j] + lose[i];
- }
- }
-
- cout << dp[x]*5ll;
- }
- int main()
- {
- ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
- solve();
- return 0;
- }