 |
| ||||
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 | |||||||||
可以把多重背包转化为01背包来做，也可以转化为完全背包来做前者复杂度O(V*Σlog n[i]) ,后者复杂度O(6*sum/2) 这道题因为sum比较大所以前者更快，但poj 1742用前者来做会TLE，后者O（N*M）能过。 http://hi.baidu.com/new/best_of_me Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
