USACO Big Barn 解题报告

这道题是求一个square中的最大的全1（或全0）的square的面积（边长）。应该是道比leetcode上最大矩形面积简单些的题。

/* 
ID: thestor1 
LANG: C++ 
TASK: bigbrn 
*/
#include <iostream>
#include <fstream>  
#include <cmath>  
#include <cstdio>  
#include <cstring>  
#include <climits>  
#include <cassert>  
#include <string>  
#include <vector>  
#include <set>
#include <map>  
#include <queue>  
#include <stack>  
#include <algorithm>
#include <cassert>

using namespace std;

int main()
{
	ifstream fin("bigbrn.in");
	ofstream fout("bigbrn.out");

	int N, T;
	fin>>N>>T;
	std::vector<std::vector<int> > grid(N, std::vector<int>(N, 1));
	for (int i = 0; i < T; ++i)
	{
		int r, c;
		fin>>r>>c;
		grid[r - 1][c - 1] = 0;
	}
	
	int maxl = 0;
	std::vector<std::vector<int> > maxrec(N, std::vector<int>(N, 0));
	for (int c = 0; c < N; ++c)
	{
		maxrec[0][c] = grid[0][c];
		if (maxrec[0][c] == 1)
		{
			maxl = 1;
		}
	}
	for (int r = 0; r < N; ++r)
	{
		maxrec[r][0] = grid[r][0];
		if (maxrec[r][0] == 1)
		{
			maxl = 1;
		}
	}


	for (int r = 1; r < N; ++r)
	{
		for (int c = 1; c < N; ++c)
		{
			if (grid[r][c] == 0)
			{
				maxrec[r][c] = 0;
			}
			else
			{
				maxrec[r][c] = min(min(maxrec[r - 1][c], maxrec[r][c - 1]), maxrec[r - 1][c - 1]) + 1;
				if (maxrec[r][c] > maxl)
				{
					maxl = maxrec[r][c];
				}
			}
		}
	}

	fout<<maxl<<endl;
	fin.close();
	fout.close();
	return 0;  
}