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

同问同问想不到除这种超朴素以为的方法了 500多ms啊

Posted by alpc04 at 2005-12-12 23:25:32 on Problem 1118
In Reply To:我o(n^2*log(n))就过了，对斜率排序，但有没有更快方法 Posted by:ChenXiXing at 2005-05-05 16:21:15

Followed by:

hash O(n^2) (0) Ikki 2005-12-13 09:10:53
- hash 怎么做？想不到... (0) alpc04 2005-12-13 12:59:28
  - 随便hash一下...只要有luck...不要太多collision就好了 (0) Ikki 2005-12-13 16:40:03
    - pku1118 (53) huweihuab 2006-09-13 08:46:38
    - hash用atan()映射到0~180应该比较均匀吧 (30) zyz 2007-05-22 07:55:04

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