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

直接向上遍历父节点就可以了，排序会超时

Posted by xiaomi at 2004-03-14 22:04:42 on Problem 1330
In Reply To:不需要 Posted by:hz02ruc at 2004-03-14 21:40:22

Followed by:

Re:直接向上遍历父节点就可以了，排序会超时 (72) Aimy 2004-03-14 22:57:47
- 一维数组就可以，存储父节点，然后根据输入的最后一行数据向上遍历 (82) hz02ruc 2004-03-15 16:05:11
  - Re:一维数组就可以，存储父节点，然后根据输入的最后一行数据向上遍历 (86) xiaoxiao 2004-03-16 10:57:46
- LCA问题，可以转化成RMQ，然后有一个O(n)预处理，O(1) query的算法。 (82) dynamic 2004-03-16 14:33:51
  - 也有一个比较简单的离线并查集，算法导论上有 (0) dynamic 2004-03-16 14:34:26
    - 不过对这题没有必要了，只有一个query... (0) dynamic 2004-03-16 14:36:12

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