思路:以row数组记录行中从此位置到下一个1一共多少0,col记录列中的。
转移方程:f[i][j]=min(f[i-1][j-1],min(col[i-1][j],row[i][l-1]));
#include<bits/stdc++.h>
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define ll long long
#define ld long double
#define mem(ar,num) memset(ar,num,sizeof(ar))
#define me(ar) memset(ar,0,sizeof(ar))
#define lowbit(x) (x&(-x))
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define lcm(a,b) ((a)*(b)/(__gcd((a),(b))))
#define Max 2510
#define mod 1000000007
using namespace std;
int n, m, ans;
int a[Max][Max], f[Max][Max], row[Max][Max], col[Max][Max];
int main() {
cin >> n >> m;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= m; j++) {
cin >> a[i][j];
if(!a[i][j]) {
row[i][j] = row[i][j - 1] + 1;
col[i][j] = col[i - 1][j] + 1;
}
if(a[i][j]) {
f[i][j] = min(f[i - 1][j - 1], min(row[i][j - 1], col[i - 1][j])) + 1;
ans = max(ans, f[i][j]);
}
}
}
me(f),me(row),me(col);
for(int i = 1; i <= n; i++) {
for(int j = m; j >= 1; j--) {
if(!a[i][j]) {
row[i][j] = row[i][j + 1] + 1;
col[i][j] = col[i - 1][j] + 1;
}
if(a[i][j]) {
f[i][j] = min(f[i - 1][j + 1], min(row[i][j + 1], col[i - 1][j])) + 1;
ans = max(ans, f[i][j]);
}
}
}
cout << ans;
return 0;
}