 |
| ||||
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:要是世界上真的有三维线段树就好了,原来我想的有问题,还是用UNI说的最朴素的方法过的In Reply To:Re:要是世界上真的有三维线段树就好了,原来我想的有问题,还是用UNI说的最朴素的方法过的 Posted by:atlas_of_rruucc at 2004-08-30 08:36:56 > 我尝试过…… > 不过后来发现那样插入一次复杂度不是（LogN）^3，而是比这个大得多 > 不然的话就很爽了，总共复杂度就只有N*（LogN）^3，1S内就可以出解了 > 与边界面积有关的....O(N^2LOGN)吧...不过还是要除以3因为是分成8分... 呵呵..还是比朴素的快一点的..... Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
