 |
| ||||
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)的算法，可能是输入太浪费时间了In Reply To:挂掉了，O(N)的算法，可能是输入太浪费时间了 Posted by:oeym at 2006-05-12 16:26:18 所谓的O(n)算法是指的那个是 The LCA Problem Revisited by Bender,Farach-Colon还是 Fast Algorithms for Finding Nearest Comman Ancestors by Harel,Tarjan阿 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
