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

2932 O(nlogn)的扫描线算法

Posted by gaminerie at 2006-08-05 20:00:34
In Reply To:请教2926, 2932的低于O(n^2)的做法……拜谢 Posted by:RoBa at 2006-08-05 19:32:33 
当时用了stl的set，比较函数又开了根号，效率不高
但是复杂度确实是O(nlogn)

不太容易讲，想知道的话加我QQ 346693733，我跟你说
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