Submission #183438

---

Source Code Expand

#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>

#define cauto const auto&
#endif

using namespace std;


typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
	v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
	stringstream ss;
	ss << f;
	ss >> t;
}


#define REP(i,n) for(int i=0;i<int(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define RALL(v) (v).rbegin(),(v).rend()
#define PB push_back


#define MOD 1000000007LL
#define EPS 1e-8



int main(){
	int h, w;
	cin >> h >> w;
	int c;
	VV(int) s1, s2;
	initvv(s1, h + 1, w + 1);
	initvv(s2, h + 1, w + 1);
	
	for(int i = 1; i <= h; ++i)
	for(int j = 1; j <= w; ++j){
		cin >> c;
		(i + j & 1 ? s1 : s2)[i][j] = c;
	}
	
	for(int i = 1; i <= h; ++i)
	for(int j = 0; j <= w; ++j){
		s1[i][j] += s1[i - 1][j];
		s2[i][j] += s2[i - 1][j];
	}
	for(int i = 0; i <= h; ++i)
	for(int j = 1; j <= w; ++j){
		s1[i][j] += s1[i][j - 1];
		s2[i][j] += s2[i][j - 1];
	}
	
	int ans = 0;
	for(int y2 = 1; y2 <= h; ++y2)
	for(int y1 = 0; y1 < y2; ++y1)
	for(int x2 = 1; x2 <= w; ++x2)
	for(int x1 = 0; x1 < x2; ++x1){
		int t = s1[y2][x2] - s1[y1][x2] - s1[y2][x1] + s1[y1][x1];
		int u = s2[y2][x2] - s2[y1][x2] - s2[y2][x1] + s2[y1][x1];
		if(t == u){
			ans = max(ans, (y2 - y1) * (x2 - x1));
		}
	}
	cout << ans << endl;
}

Submission Info

Judge Result