 |
| ||||
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？我觉得要想知道酋长的花费只需知道和酋长邻接的点花费多少，知道邻接的花费多少，只需知道邻接邻接的花费多少。然后dfs从底层去找到每一个点的最少花费，一直到酋长。为啥是最短路呢？ Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
