 |
| ||||
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 | |||||||||
麻烦牛人帮忙分析下，谢谢了。这道题目的常规思路是对于每种颜色计算sum/2的背包，然后用sum-f[sum/2]。 我开始的思路是对sum做背包，然后找最接近sum/2(sum/2+1奇数的情况)。自己的想法是在时间复杂度上更高，但是感觉结果应该是一样的啊。。。。。。 但是自己的思路ＷＡ，改成常规思路后ＡＣ，谁能帮忙分析下，谢谢了。 如果能给出例子，万分感谢． Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
