暴力+扩展谷树卡常就能过……
by JeffZhao @ 2022-06-03 07:42:44
块长调成 $O(n^{2/3})$ 就行了吧
by bykem @ 2022-06-03 07:53:30
@[JeffZhao](/user/120017) 扩展谷树是啥
by happybob @ 2022-06-03 07:59:57
@[happybob](/user/332914) 史上最强数据结构![](//图.tk/6)
by rsdbk_husky @ 2022-06-03 10:13:34
我怎么感觉我被骗了,在哪都搜不到
by happybob @ 2022-06-03 10:53:34
确实吧史上最强数据结构,常数极小
by Johnsonloy @ 2022-06-03 11:03:08