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 |
经典的背包问题,O(MN)的算法,注意避免重复搜索In Reply To:请教一下算法,不想只用打-O1的GCC过啊 Posted by:frkstyc at 2005-04-17 15:15:21 > 2392,2394,2395用GCC比VC快一倍啊 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator