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

总有人不愿意写priority queue的

Posted by frkstyc at 2006-10-23 18:40:55 on Problem 3013
In Reply To:分明就是dijkstra.....SPFA也是O(VE)吧 Posted by:wywcgs at 2006-10-23 18:40:16

Followed by:

Re:问个问题，STL的heap效率怎么样？？ (35) byron 2006-10-23 18:59:28
- 谁告诉你够用的 (39) frkstyc 2006-10-23 18:59:54
  - Re:一篇论文上说spfa在稀疏图时效率和dijkstra+heap近似，我也没比较过，请大牛指教…… (0) byron 2006-10-23 19:02:21
    - 想当然的结论 (0) frkstyc 2006-10-23 19:02:41
      - Re:晕，那我还是乖乖的写heap吧…… (0) byron 2006-10-23 19:03:43
    - 既然这道题过不去，那就证明那篇论文写得不对 (60) wywcgs 2006-10-23 19:03:53
      - 1695735 ArXoR 3013 Accepted 3056K 1779MS 就是用这个挤过的... (64) ArXoR 2006-10-23 19:06:09
        数据weak了…… (0) frkstyc 2006-10-23 19:06:50
        嗯,3037我用这个就没挤过了 (0) ArXoR 2006-10-23 19:08:17
        cong~~ (0) frkstyc 2006-10-23 19:09:39
        但是我队友却用它搞过了-_-b不公啊... (0) ArXoR 2006-10-23 19:11:44
        我认为不过正常，过了才不正常- - (0) wywcgs 2006-10-23 19:13:35
        ax只是说不公…… (0) frkstyc 2006-10-23 19:14:58
        ...... (0) wywcgs 2006-10-23 19:08:04
      - bfm可以很慢的...即使m=O(n)... (96) frkstyc 2006-10-23 19:06:24
        Re:正如frkstyc大牛所说，bfm确实可以很慢……受教…… (0) byron 2006-10-24 12:53:52

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