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

我想了一个也很麻烦的算法,一次SPLAY TREE 再 用一次disjoint set nlogn+n

Posted by LIANGLIANG at 2004-12-16 12:54:28 on Problem 2131
In Reply To:高手们是怎么做的啊 Posted by:uni at 2004-11-30 02:34:06 
> 我想了个ON(LOGN)^2的..要用3次BST...麻烦得我都不想写了...
> 高手有没有什么更好的啊
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