| ||||||||||
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 |
Re:是吗?可以稍微讲一下啵?In Reply To:是吗?可以稍微讲一下啵? Posted by:alpc16 at 2007-08-14 19:28:13 用tree dp 做,我还用到了母函数~~ f[u][i] 表示 以接点u为根的子树中选i个 所要花费的最小代价~~ f[u][i] = Min{ f[v1][k1] + f[v2][k1] + .. f[vj][kj] } v 为 u 的孩子接点~~ k1+k2+..+ki = i ( 可以用母函数求) Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator