Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
 Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

哈～～我们也是这方法，也是一直wa

Posted by 35060622 at 2007-10-30 20:28:40
In Reply To:原来你们都是tle的？我的一直wa Posted by:limingfei at 2007-10-30 17:41:32 
> 就是用kruskal+并查集+链表求出每对点之间最小边最大的路,O(eloge + n^2)，然后读进来O(1)的判断,然后就一直wa……，难道这样做不对吗？？？
Followed by:
Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator