是 O(能过)
by x义x @ 2019-12-14 15:10:11
@[i_am_aking_ioi](/user/87799) 时间复杂度是$O(n^2m)$，但往往跑不满，很多时候复杂度低于$O(nm)$
by xukuan @ 2019-12-14 15:31:33
@[xukuan](/user/27924) 可是O(nm)也有10000*100000啊
by xh39 @ 2019-12-14 16:20:39
@[i_am_aking_ioi](/user/87799) 低于不是等于
by xukuan @ 2019-12-14 16:33:11