Detail of message

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

看我这个才够狠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 on Problem 2490


Problem Id:2490  User Id:sunmoonstar_love 
Memory:120K  Time:3000MS
Language:G++  Result:Accepted

Followed by:

UP,我的方法是二进制状态背包式DP，用了3000ms，请教个好方法，f[1<<n] 下存此状态下的最小费用，一直维护这个数组，直到填到f[(1<<n)-1] (115) sunmoonstar_love 2005-09-06 01:27:48
- UP (0) sunmoonstar_love 2005-09-06 13:47:44
  - 这个一定要up (0) sunmoonstar_love 2005-09-06 15:26:00

Post your reply here:

Home Page Go Back To top

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