 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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 | |||||||||
UPIn Reply To:UP,我的方法是二进制状态背包式DP，用了3000ms， 请教个好方法，f[1<<n] 下存此状态下的最小费用，一直维护这个数组，直到填到f[(1<<n)-1] Posted by:sunmoonstar_love at 2005-09-06 01:27:48 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
