洛谷P1387 最大正方形(简单dp)

#include<stdio.h>
#include<iostream>
#include<map>
#include<algorithm>
#include<string.h>
using namespace std;
int a[1005][1005];
int dp[1005][1005];
int main()
{
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			scanf("%d", &a[i][j]);
		}
	}
	for (int j = 0; j < m; j++)
	{
		dp[0][j] = a[0][j];
	}
	for (int i = 0; i < n; i++)
	{
		dp[i][0] = a[i][0];
	}
	int ans = 0;
	for (int i = 1; i < n; i++)
	{
		for (int j = 1; j < m; j++)
		{
			if (a[i][j] == 1)
			{
				dp[i][j] = min(dp[i - 1][j], min(dp[i][j - 1], dp[i - 1][j - 1])) + a[i][j];
			}
			ans = max(ans, dp[i][j]);
		}
	}
	cout << ans << endl;
}