 |
| ||||
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:不知道什么是trivial，不过我的做法是如果DFS树中k的儿子i能到达的最小深度>=k的深度，那么 subset[k]++,结果就是subset[k]+1(根除外)In Reply To:不知道什么是trivial，不过我的做法是如果DFS树中k的儿子i能到达的最小深度>=k的深度，那么 subset[k]++,结果就是subset[k]+1(根除外) Posted by:liangzhirong at 2006-08-17 17:17:44 根也是要加1吧，因为当遍历第一个子树时，sub[root]还是0，遍历剩下的子树时，sub[root]每次加1，所以最后根作为割点的话结果应该是sub[root]+1 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
