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

UP,我的方法是二进制状态背包式DP，用了3000ms， 请教个好方法，f[1<<n] 下存此状态下的最小费用，一直维护这个数组，直到填到f[(1<<n)-1]

Posted by sunmoonstar_love at 2005-09-06 01:27:48 on Problem 2490
In Reply To:看我这个才够狠690302 sunmoonstar_love 2490 Accepted 120K 3000MS G++ 1.76K 2005-09-05 19:52:38.0 Posted by:sunmoonstar_love at 2005-09-05 19:55:13 
> 
> 
> Problem Id:2490  User Id:sunmoonstar_love 
> Memory:120K  Time:3000MS
> Language:G++  Result:Accepted
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