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

最长边一定是最小生成树中的最长边

Posted by TN at 2005-07-13 17:55:46 on Problem 2485
In Reply To:能不能讲讲是怎么做的，那么快？不是最小生成树吧 Posted by:sunmoonstar_love at 2005-07-13 17:53:57

Followed by:

然后用prim就可以了吧 (0) TN 2005-07-13 17:56:53
- 那怎么那么快呀46ms，只读数据就那么多时间了 (0) sunmoonstar_love 2005-07-13 18:00:21
  - OJ (0) TN 2005-07-13 18:00:40
    - OJ测时间有误差的 (0) TN 2005-07-13 18:00:55
  - 我的程序就是46MS,不过是比赛后再次提交后出现的,同样代码比赛时要用78MS (10) tq 2005-07-14 19:00:13
这个结论怎么证明呢？ (0) Acsaga 2006-12-03 22:02:30
- 想想kruskal... (0) frkstyc 2006-12-03 22:53:48
  - 恩..谢styc. (0) Acsaga 2006-12-03 23:11:11

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