 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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 | |||||||||
Re:我o(n^2*log(n))就过了，对斜率排序，但有没有更快方法In Reply To:Re:我o(n^2*log(n))就过了，对斜率排序，但有没有更快方法 Posted by:direfire at 2006-10-13 23:14:51 > 任意两点的斜率? 那排完怎么做? 排序的时候在斜率相同的时候可以按照点的顺序排序。。这样使得相邻的点对都是可以连接的。。然后加上hash就行了～ Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
