Detail of message

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

啥lca-rmq, 根本就是后序遍历+树型dp,O(n)复杂度,怪不得我的线段树超时!

Posted by wangfangbob at 2007-10-07 12:46:42 on Problem 3417
In Reply To:弱问一下这题怎么做...看了解题报告一头雾水... Posted by:RoBa at 2007-10-06 21:19:48

Followed by:

要求详细 (0) cuiaoxiang 2007-10-07 12:48:43
我的歪招! (229) wangfangbob 2007-10-07 20:10:31
- 确实。。不错的方法！ (2) ogogo 2007-10-07 20:30:49
- Re:我的歪招! (19) uncia 2012-08-04 10:49:42
呵呵,别人都是怎么做的? (0) wangfangbob 2007-10-07 20:44:12
- 把你的想法反过来考虑对于删除每个新边考虑再删除哪些旧边是可以的需要用到求LCA (0) ogogo 2007-10-07 20:48:29
  - 哦,好像有点道理,我当时看解题报告,以为是遍历旧边找新边,后面的就没看,原来是看错了,呵呵 (0) wangfangbob 2007-10-07 21:17:30

Post your reply here:

Home Page Go Back To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator