Submission #636116

---

Source Code Expand

#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
using namespace std;

#define REP(i,n) for(int i=0; i<n; i++)
#define FOR(i,a,b) for(int i=a; i<=b; i++)
#define FORR(i,a,b) for (int i=a; i>=b; i--)

typedef long long ll;

int b[101][101]={} , w[101][101]={};

int main(void){
	int H,W;
	cin >> H >> W;
	REP(i,H){
		REP(j,W){
			if((i+j)%2==0)
				cin >> b[i+1][j+1];
			else
				cin >> w[i+1][j+1];
		}
	}
	FOR(i,1,H){
		FOR(j,1,W){
			b[i][j]+=b[i][j-1];
			w[i][j]+=w[i][j-1];
		}
	}
	int ans = 0;
	REP(l,W){
		FOR(r,l+1,W){
			vector<int> s(H+1,0);
			REP(i,H){
				s[i+1] = s[i]+(b[i+1][r]-b[i+1][l])-(w[i+1][r]-w[i+1][l]);
			}
			map<int,int> M;
			REP(i,H+1){
				if (M[s[i]]>0)
					ans = max(ans,(r-l)*(i-M[s[i]]+1));
				else
					M[s[i]]=i+1;
			}
		}
	}

	cout << ans << endl;


	return 0;
}

Submission Info

Judge Result