Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

经典的背包问题,O(MN)的算法,注意避免重复搜索

Posted by TN at 2005-04-17 15:46:51 on Problem 2392
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:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator