 |
| ||||
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 | |||||||||
Re:我是O(N)做的，一次DFS就可以了In Reply To:Re:我是O(N)做的，一次DFS就可以了 Posted by:daofeng at 2004-05-22 22:29:58 没有啊，在回溯的时候修改一个点的子节点总数D[i] B[i]=max(D[child(i)], n-D[i]-1) Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
