20分

P1064 [NOIP2006 提高组] 金明的预算方案

"if ( j >= v[z] + v[c2] + v[c1] ) dp[j] = max ( dp[j], dp[j - v[z] - v[c2] - v[c1]] + w[c2] + w[z] + w[c2] );" **中有两个"+w[c2]"**
by wowwowwow @ 2022-01-21 21:37:29


~~下次写讨论时记得加上注释~~,
by wowwowwow @ 2022-01-21 21:41:04


|