所以怎么卡常？？？
各种优化乱搞也才 $146ms~~~rk7$
by nothingness @ 2018-12-25 20:25:41
@[nothingness](/space/show?uid=31317) 不妨试一下分块， 在块大小上做些文章， 在玄学一下也许能超过146（
by Juan_feng @ 2018-12-25 20:32:02
@[Juan_feng](/space/show?uid=66965)
我觉得树状数组应该是最快的吧。。。常数小复杂度也小
$rk1$ 就是树状数组
by nothingness @ 2018-12-25 20:33:49
除非~~面向数据~~编程？~~（滑稽~~
by nothingness @ 2018-12-25 20:34:18
@[nothingness](/space/show?uid=31317) ~~那样可以做到O(1)~~
by RiverFun @ 2018-12-25 20:35:03
@[nothingness](/space/show?uid=31317) 但分块的单点查询是O1的啊qwq
by Juan_feng @ 2018-12-25 20:36:01
@[Steve_braveman](/space/show?uid=96570)
应该是$O(m)$ 毕竟可以全部进行查询
by nothingness @ 2018-12-25 20:36:22
@[nothingness](/space/show?uid=31317) 我指的是单次查询
by RiverFun @ 2018-12-25 20:39:08
@[nothingness](/space/show?uid=31317) 不对，是单次修改
by RiverFun @ 2018-12-25 20:39:59
@[nothingness](/space/show?uid=31317) fread(
by LanrTabe @ 2019-01-06 21:22:29