居然只得30分

P1387 最大正方形

给你看看我的状态转移,你的状态转移我没太看懂() ```cpp if(!g[i][j]) f[i][j] = 0; else f[i][j] = 1 + min(min(f[i - 1][j], f[i][j - 1]), f[i - 1][j - 1]); ```
by wangjue233 @ 2023-11-15 21:37:42


$g[i][j]$ 是输入的数组 @[zhengminzhuo1212](/user/1093166)
by wangjue233 @ 2023-11-15 21:38:32


@[wangjue233](/user/739233) 我试一试
by zhengminzhuo1212 @ 2023-11-15 21:42:36


我的思路跟您差不多,但您的n-i m-i 还要加一 不然只能算到一部分; min(n,m)需要减一
by YRCTTT @ 2024-01-06 10:17:56


@[Risen161](/user/1123514) 哦,我试一试
by zhengminzhuo1212 @ 2024-03-11 20:39:35


|