| ||||||||||
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 |
N^2的就可以过,NlgN的太复杂了In Reply To:请问半平面交的O(N logN)算法网上哪里有资料?算法艺术上好像没有详讲。 Posted by:ImLazy at 2008-09-02 22:50:49 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator