Submission #1672610

---

Source Code Expand

#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <unordered_map>
#include <cstdlib>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000000000000000000000001
#define LONG_INF 3000000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)                                                                             
#define seg_size 524288
int grid[2][200][200] = {};
int input[200][200] = {};
int main() {
	int h, w;
	cin >> h >> w;
	REP(i, h) {
		REP(q, w) {
			cin >> input[i][q];
		}
	}
	for (int t = 0; t < 2; ++t) {
		for (int i = 0;i < h;++i) {
			for (int q = 0;q < w;++q) {
				if (q != 0) grid[t][i][q] = grid[t][i][q - 1];
				if ((i + q + t) % 2 == 0) grid[t][i][q] += input[i][q];
			}
		}
		for (int i = 0;i < w;++i) {
			for (int q = 0;q < h;++q) {
				if (q != 0) grid[t][q][i] += grid[t][q - 1][i];
			}
		}
	}
	int ans = 0;
	for (int left_l = 0;left_l < h;++left_l) {
		for (int left_r = left_l + 1;left_r <= h;++left_r) {
			for (int right_l = 0;right_l < w;++right_l) {
				for (int right_r = right_l + 1;right_r <= w;++right_r) {
					long long a = grid[0][left_r - 1][right_r - 1], b = grid[1][left_r - 1][right_r - 1];
					if (right_l - 1 >= 0) {
						a -= grid[0][left_r - 1][right_l - 1];
						b -= grid[1][left_r - 1][right_l - 1];
					}
					if (left_l - 1 >= 0) {
						a -= grid[0][left_l - 1][right_r - 1];
						b -= grid[1][left_l - 1][right_r - 1];
					}
					if (right_l - 1 >= 0 && left_l - 1 >= 0) {
						a += grid[0][left_l - 1][right_l - 1];
						b += grid[1][left_l - 1][right_l - 1];
					}
					if (a == b) {
						ans = max(ans, (left_r - left_l)*(right_r - right_l));
					}
				}
			}
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result