 |
| ||||
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 | |||||||||
用堆写成O(ElogV)的也许会快一点In Reply To:奇怪，用单原点最短路径，就是那个dijkastra算法，怎么要300多ms？根本不是一个数量级的嘛，难道还有更快的算法？ Posted by:yangguo981 at 2006-05-19 19:09:26 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
