 |
| ||||
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 | |||||||||
用heap实现dijkstra的问题是不是对每一个点检查其相邻结点的时候，只要相邻结点的距离变得更小，就要对heap进行相应的调整？调整复杂度为lgV，最多有E条边，所以复杂度为ElgV的？ 以前的时候一直没出问题，可是uva的ocean current得到了TLE，怀疑我的实现有问题 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
