 |
| ||||
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 | |||||||||
我看了许多资料，大概的意思复杂度都是NlogW，可是我觉得对于任意一条长度为L的线段都会修改L个线段树上的叶子结点，于是复杂度应该是O(NL)In Reply To:请教一个复杂度的问题，把N条长度至多为L，坐标范围为O..W的线段插入线段树中，复杂度为多少？ Posted by:solareclipse at 2006-02-28 19:42:23 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
