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

极角排序，O(n^2lgn)

Posted by frkstyc at 2006-03-24 17:05:23 on Problem 2737
In Reply To:这题如何优化啊，粗糙的N^3的算法必定会超时啊！ Posted by:zerocool_08 at 2006-03-24 17:02:57

Followed by:

啊？没听过，TT,大体上是什么意思？ (0) zerocool_08 2006-03-24 17:07:29
- 枚举一个点，然后拿其它点去算极角 (0) frkstyc 2006-03-24 17:09:40
  - 谢谢！！！我去学习这个后再来切这题 (0) zerocool_08 2006-03-24 17:11:10
穷举所有的N个点吗？然后算出其他的点和它的角度，按角度排序，我还是超时……（代码在内，如何进一步优化） (1364) zerocool_08 2006-03-24 18:41:43
- 需要一些优化 (1506) frkstyc 2006-03-24 19:00:11
  - 这个优化真好，下次能早到更优解的点是不可能和前面的点在同一直线上的 (30) zerocool_08 2006-03-25 00:27:29
  - Re:把点按坐标....排一下序，只枚举一个点和它右边的点优化后还是超时怎么办? (30) ice_lemon 2006-07-29 15:41:02

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