@[zzy2333](/user/118058) ？？？ 我竟然没 T （看来hzwer数据水了（
by Lates @ 2020-05-26 18:50:08
最慢的点才跑了 130ms
by Lates @ 2020-05-26 18:51:40
其实正解是二分答案
by Lates @ 2020-05-26 18:52:14
$O(k)$(最好)或$O(\sqrt n)$(最差)
by youwike @ 2020-05-26 19:02:38
@[赵泽峰哥哥](/user/261773) 复杂度不可能比 $O(k)$ 差吧，循环最多才 k 次
by iMya_nlgau @ 2020-05-26 19:12:35
O(k)
by XeF2 @ 2020-05-26 19:22:26
说反了，好尴尬
by youwike @ 2020-05-26 20:39:03
@[Lates](/user/119062) $O(\min(\sqrt n,k))$
by Gypsophila @ 2020-05-27 19:26:30
@[Lates](/user/119062) 我觉得你能跑过是因为你 $n$ 开的是 int......开 long long 你就肯定跑不过
by Gypsophila @ 2020-05-27 19:27:37
@[Gypsophila](/user/54745) 我 写 `define ing long long` （而且 AC 了
by Lates @ 2020-05-27 19:35:10