 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
Re:stl+dp(背包)In Reply To:stl+dp(背包) Posted by:TangMing at 2009-08-24 15:29:49 > 设sum[i]为第i种颜色的总和,把sum[i]/2的背包最大填满,第i种颜色耗时就为 sum[i]-dp[sum[i]/2]; 哦。。。。。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
