爆搜最简单
by ZhouLuLaoShi @ 2022-09-02 19:11:59
枚举枚举,当然就是要爆搜枚举啊
by ZhouLuLaoShi @ 2022-09-02 19:15:28
走上角for,右下角for
by ZhouLuLaoShi @ 2022-09-02 19:15:56
O(n^2)之内搞定
by ZhouLuLaoShi @ 2022-09-02 19:16:37
@[ImNot6Dora](/user/524966) %%%,竟然能够 $O(n^2)$!
by _cyle_King @ 2022-09-02 19:25:08
@[ImNot6Dora](/user/524966) 左上角两重循环,右下角两重循环,这不是 $O(n^4)$ 吗?
by _cyle_King @ 2022-09-02 19:26:59
我觉得你们得百度一下子矩阵的定义
by Seauy @ 2022-09-02 19:27:41
我只是单纯的反驳 ImNot6Dora 对时间复杂度的错误分析而已。
by _cyle_King @ 2022-09-02 19:30:57
有时候可以
by ZhouLuLaoShi @ 2022-09-02 19:33:55
@[ImNot6Dora](/user/524966) 子矩阵枚举得用 $O(2^{n+m})$,可以算暴搜吧。
by _cyle_King @ 2022-09-02 19:35:16