均摊O(logn)吗?
by LonelinessMan @ 2018-12-12 13:47:11
是啊
by Mr_Spade @ 2018-12-12 13:53:58
奥 谢谢
by LonelinessMan @ 2018-12-12 13:59:50
最多nlog,均摊nlog
by Fading @ 2018-12-12 14:06:10
@[Fading](/space/show?uid=20309) @[LonelinessMan](/space/show?uid=109418)
为啥最坏复杂度是$O(nlogn)$啊难道不是$O(n)$吗……
不是很懂两棵线段树哪里来的$O(nlogn)$级别的节点数……
by shadowice1984 @ 2018-12-12 14:19:38
@[shadowice1984](/space/show?uid=56384) 哦我说的是最多"总共"ologn,我可能说得有一点不清楚
by Fading @ 2018-12-12 14:50:04
@[shadowice1984](/space/show?uid=56384) 第一句话无视好了qwq
by Fading @ 2018-12-12 14:50:21
@[shadowice1984](/space/show?uid=56384) 加上线段树分裂,那合并的复杂度不就不能保证了吗?
by LonelinessMan @ 2018-12-12 18:07:13