没看代码
我分块T的时候好像是因为修改操作变成$O(n)$了
by Imakf @ 2019-07-03 09:15:15
所以啊……学LCT多好，板子题
by Imakf @ 2019-07-03 09:16:08
对啊，正解LCT
by Erusel @ 2019-07-03 09:21:45
@[Robinzh](/space/show?uid=53807) 分块不是也能过吗（雾
by Frozencode @ 2019-07-03 09:23:20
@[Frozencode](/space/show?uid=64166)
试着倒过来修改, 然后修改操作复杂度可能会从$\Theta(\sqrt n) $变成$\Theta( 1)$? (雾)
by aminoas @ 2019-07-03 09:39:36
@[QwQ自动机](/space/show?uid=143834) 不可能O1修改啊（雾，得更新块内所有点的信息啊qwq
by Frozencode @ 2019-07-03 09:43:31
@[Frozencode](/space/show?uid=64166) update()操作复杂度 ...
by aminoas @ 2019-07-03 09:44:37
@[QwQ自动机](/space/show?uid=143834) ??我写的不是$\sqrt{n}$的修改吗qwq
by Frozencode @ 2019-07-03 09:45:58
@[QwQ自动机](/space/show?uid=143834) qwq懂了
by Frozencode @ 2019-07-03 09:53:44
此贴已结 感谢@[QwQ自动机](/space/show?uid=143834) qwq
by Frozencode @ 2019-07-03 09:59:10