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

Re:请教高手给个好算法! 我的Prim超时了...

Posted by lynncui at 2008-08-21 22:45:22 on Problem 3625
In Reply To:请教高手给个好算法! 我的Prim超时了... Posted by:MasterLuo at 2008-08-21 19:10:33

prim + heap
或者 + stl的最小优先队列都没问题

Followed by:

Re:难道prim写得太烂了...没用堆,直接快排的. (0) MasterLuo 2008-08-21 23:12:18
- 快排，Orz，快排比你直接O（n）找最小值更慢。。。。 (0) lynncui 2008-08-22 01:32:52
  - Re:优先队列与快排不都是O(NlogN)么... (0) MasterLuo 2008-08-22 02:19:31
    - 优先队列和HEAP都是lgN (0) lynncui 2008-08-22 02:23:23
      - Re:果然...弱了..优先队列313MS水过了. (0) MasterLuo 2008-08-22 02:40:41
        这么慢吗，用优先队列应该<100ms的 (0) lynncui 2008-08-22 03:06:00

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