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:O(V*Σlog n[i])的复杂度的童鞋应该不行In Reply To:Re:O(V*Σlog n[i])的复杂度的童鞋应该不行 Posted by:Kuroro at 2012-12-02 14:15:03 稍微优化一下还是可以的吧,比如某种物品的总体积大于背包容量时可以当成完全背包来做 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator