 |
| ||||
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]代表最后有j辆车停在以i为根的子树中最小代价。枚举每棵子树中的车数量，合并，复杂度是n*k*kIn Reply To:扩展一下 Posted by:lianzhouxiaowu at 2010-05-31 18:45:50 > 要是这题工人的数目是一个给定的值k，结果怎样求? Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
