Gym 102091L. Largest Allowed Area (DP)

Description

Solution
至多有1个1的情况下，求最大全0子正方形
在裸的最大0子矩阵的DP状态下再加一位0/1，表示无1/有一个1的情况下的最优解
用二维前缀和判断，暴力(乱搞)转移即可

Hint
2e7的读入，生而为人，别太过分

Code

const int maxn = 1e3 + 7;
int read() {
    int num = 0, F = 1; char c = ' ';
    while (c < '0' || c > '9') F = (c == '-') ? -1 : 1, c = getchar();
    while (c >= '0' && c <= '9') num = (num << 1) + (num << 3) + c - '0', c = getchar();
    return num * F;
}
int n,m;
int mp[maxn][maxn];
int sum[maxn][maxn];
int dp[maxn][maxn][2];
void init(){
	for(int i = 1;i <= n;++i){
		for(int j = 1;j <= m;++j){
			dp[i][j][0] = dp[i][j][1] = 0;
			sum[i][j] = sum[i-1][j] + sum[i][j-1] - sum[i-1][j-1] + mp[i][j];
		}
	}
}
int get_sum(int x1,int y1,int x2,int y2){
	return sum[x2][y2] - sum[x2][y1-1] - sum[x1-1][y2] + sum[x1-1][y1-1];
}

void cal(int i,int j,int op1,int op2,int op3){
	int mi = min(min(dp[i][j-1][op1],dp[i-1][j-1][op2]),dp[i-1][j][op3]);
	int tot = get_sum(i-mi,j-mi,i,j);
	if(tot > 1) return ;
	if(tot == 0) dp[i][j][0] = max(dp[i][j][0], mi + 1);
	if(tot == 1) dp[i][j][1] = max(dp[i][j][1], mi + 1);
}

void solve(){
	init();
	for(int i = 1;i <= n;++i) 
		for(int j = 1;j <= m;++j)
			for(int k1 = 0;k1 < 2;++k1)
				for(int k2 = 0;k2 < 2;++k2)
					for(int k3 = 0;k3 < 2;++k3)
						cal(i,j,k1,k2,k3);
}
int main() {
	int T;scanf("%d",&T);
	while(T--){
		n = read();m = read();
		for(int i = 1;i <= n;++i) {
			for(int j = 1;j <= m;++j) {
				mp[i][j] = read();
			}
		}
		solve();
		int res = 0;
		for(int i = 1;i <= n;++i)
			for(int j = 1;j <= m;++j)
				res = max(res,max(dp[i][j][0],dp[i][j][1]));
		printf("%d\n", res);
	}
    return 0;
}