 |
| ||||
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 | |||||||||
关于这道题忙活了一天一夜,终于搞定,用graham,极角排序用堆实现,123ms, 一开始因为一个判断条件没写WA了无数次. 网上看到说可以不用枚举用"对踵点"可调出o(n)的时间,可就是一直WA,调不出来.还发现用包裹壳法会超时,因为会有所有点都在凸包上的情况. Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
