 |
| ||||
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 | |||||||||
动态归划也可以吧。dp[i][j]表示b里面value的最大值 i表示已经放的那些东西放在了哪个桶里面，j表示上一次是放在哪个桶里面 复杂度是3^nIn Reply To:逼我用全排列O（n!*n） Posted by:1210812305 at 2011-07-20 10:54:56 dp[i][j]表示b里面value的最大值 i表示已经放的那些东西放在了哪个桶里面，j表示上一次是放在哪个桶里面 复杂度是3^n Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
