 |
| ||||
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+枚举。还以为会超时呢，居然是0ms。我没有用到题解里面的第3种情况，前两种情况，然后对每个节点o(n^2)枚举一下就ok。 感觉这样的方法自己能够理解和接受，就是代码多了点。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
