F.A.Qs Home ProblemSet Status Ranklist Contest LoginRegister
Notice:1:注册本OJ方式请见https://www.lydsy.com/JudgeOnline/wttl/thread.php?tid=5671 2:请不要在讨论区中发空白主题帖。
大视野在线测评-欢迎您
[ New Thread ]
Problem 5327 >> O(K^2*LOG(N))能过吗??
save_code @ 2018-06-11 18:08:34
[ Quote ] [ Edit ] [ Delete ] 1#
RT
save_code @ 2018-06-11 18:09:33
[ Quote ] [ Edit ] [ Delete ] 2#
解 模线性方程,和模线性不等式,一共K^2次
save_code @ 2018-06-11 18:14:05
[ Quote ] [ Edit ] [ Delete ] 3#
似乎还要一次 最小生成树
nzhtl1477 @ 2018-06-12 12:40:49
[ Quote ] [ Edit ] [ Delete ] 4#
orz
shanquan2 @ 2018-08-03 17:33:52
[ Quote ] [ Edit ] [ Delete ] 5#
orz
虽然O(klogn)不是也挺简单的吗
[Top] [Previous Page] [Next Page]

HOME Back