@[kid_magic](/user/316801) 那说明你写挂了,$n^\frac{2}{3}$ 绝对可以过
by OldVagrant @ 2022-07-20 13:34:21
[AC记录](https://www.luogu.com.cn/record/66137704)
by OldVagrant @ 2022-07-20 13:34:53
还有这个题的数据比较玄学，带修莫队的块长实际上也比较玄学，反正 $n^\frac{2}{3}$绝对比$\sqrt n$优
by OldVagrant @ 2022-07-20 13:36:03
[详见ouuan的博客](https://ouuan.github.io/post/%E8%8E%AB%E9%98%9F%E5%B8%A6%E4%BF%AE%E8%8E%AB%E9%98%9F%E6%A0%91%E4%B8%8A%E8%8E%AB%E9%98%9F%E8%AF%A6%E8%A7%A3/)
by OldVagrant @ 2022-07-20 13:45:54
@[z_z_y](/user/438168) 不过这题本身时间复杂度就很卡吧。。。
by YukinoYukinoshita @ 2022-07-20 14:48:14
@[kid_magic](/user/316801) $n^\frac{5}{3}$ 的复杂度的话这题算个3e8，开O2并且2.5s的话随便过啊，莫队本来就跑不满
by OldVagrant @ 2022-07-20 14:53:01