 |
| ||||
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 | |||||||||
汗极……………… 我以为那样会很慢呢………………In Reply To:Re:请教过了的高手! 我用三维的线段树,但是好象RE了,估计是内存的问题,有更巧妙一些的方法吗? Posted by:uni at 2004-08-28 12:07:14 > 1维的线段数就可以过了 > O(N^2LOGN) Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
