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

貌似可以不用半平面交

Posted by Los_Angelos_Laycurse at 2014-05-04 17:37:41 on Problem 3743 and last updated at 2014-05-04 17:38:42 
直接对交点排序+枚举就能搞定 貌似。。。。

复杂度 O(n^2*log(n))+O(n^3)
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