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

这题ON的算法反而慢ON2的快了一倍...

Posted by uni at 2005-04-13 10:23:45 on Problem 1655
In Reply To:我是O(N)做的，一次DFS就可以了 Posted by:xiaomi at 2004-05-22 18:18:47

Followed by:

似乎NlogN的排序+N的遍历也不会慢一倍，78ms (0) frkstyc 2005-04-13 11:13:10
怎样的o(n^2)? (0) ciciatc 2005-04-13 11:31:39
- 枚举每一个点，删去后dfs？ (0) frkstyc 2005-04-13 11:48:33
  - 我只想了个O（N）的。然后偷懒写了个比较好写的数据结构结果MLE了. (0) ciciatc 2005-04-13 17:16:47
    - 明天不懒了，写稍微复杂一点的.-_- (0) ciciatc 2005-04-13 17:17:47
      - 如果你答应到了北大以后请我吃饭的话,我可以教你PST数据结构~~:) (0) uni 2005-04-13 20:02:51
        恩好啊 (0) ciciatc 2005-04-14 08:41:02
        Re:如果你答应到了北大以后请我吃饭的话,我可以教你PST数据结构~~:) (42) sunzed 2005-06-13 21:35:33
        笑话还真当真了…… (46) frkstyc 2005-06-13 21:47:57
    - 邻接表就行了,不复杂啊 (0) ArXoR 2005-04-13 17:20:48
      - 我就做了一个邻接表 (0) frkstyc 2005-04-13 21:29:54
        排一下序用起来就感觉就很舒坦了 (0) frkstyc 2005-04-13 21:36:53

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