Submission #1655917

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=(n)-1;i>=0;i--)
#define VSORT(v) sort(v.begin(), v.end())
#define DVSORT(v) sort(v.begin(), v.end(),greater<int>())
#define SORT(v, n) sort(v, v+n)
#define DSORT(v,n) sort(v, v+n,greater<int>())
#define vi vector<int>
#define pb push_back
#define P pair<int,int>

template <class T> void chmin(T&a,const T&b) { a = min(a,b); }
template <class T> void chmax(T&a,const T&b) { a = max(a,b); }

void print(){cout<<endl;}
template <class Head, class... Tail>
void print(Head&& h,Tail&&... t){ 
	if(sizeof...(t)==0)
		cout<<h;
	else
		cout<<h<<' ';
	print(move(t)...);
}

const double EPS =1e-9;
const long INF =2147483647;//32bit 2*1e+9
const long MOD =1e+9+7;
#define PI 3.14159265258979

int dy[]={0, 0, 1, -1, 1, 1, -1, -1};
int dx[]={1, -1, 0, 0, 1, -1, -1, 1};


int main(void){
	int H,W,numbers,maxs=0;
	int chocorate[101][101]={};

	cin>>H>>W;
	FOR(i,1,H+1){
		FOR(j,1,W+1){
			cin>>numbers;
			if((i+j)%2==1) numbers=-numbers;
			chocorate[i][j]=numbers;
		}
	}

	FOR(i,1,H+1)
		FOR(j,1,W+1)
			chocorate[i][j]+=chocorate[i][j-1];
	
	FOR(fy,1,H+1){
		FOR(ly,fy,H+1){
			FOR(fx,1,W+1){
				FOR(lx,fx,W+1){
					int sum=0;
					FOR(i,fy,ly+1) sum+=(chocorate[i][lx]-chocorate[i][fx-1]);
					if(sum==0) chmax(maxs,(lx-fx+1)*(ly-fy+1));
				}
			}
		}
	}
		
	print(maxs);
	return 0;
}

Submission Info

Judge Result