 |
| ||||
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:我看了许多资料，大概的意思复杂度都是NlogW，可是我觉得对于任意一条长度为L的线段都会修改L个线段树上的叶子结点，于是复杂度应该是O(NL) Posted by:solareclipse at 2006-02-28 19:43:32 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
