Submission #1612558

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#define lol(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
int p[110][110],q[110][110];
int main(){
	int h,w;
	cin>>h>>w;
	lol(i,h+1)p[i][0]=0,q[i][0]=0;
	lol(j,w+1)p[0][j]=0,q[0][j]=0;
	for(int i=1;i<=h;i++){
		for(int j=1;j<=w;j++){
			int x;cin>>x;
			p[i][j]=p[i-1][j]+p[i][j-1]-p[i-1][j-1];
			q[i][j]=q[i-1][j]+q[i][j-1]-q[i-1][j-1];
			if((i+j)%2==0){
				p[i][j]+=x;
			}
			else{
				q[i][j]+=x;
			}
		}
	}
	int ans=0;
	lol(i,h)for(int j=i+1;j<=h;j++){
		lol(left,w)for(int right=left+1;right<=w;right++){
			int psum=p[j][right]-p[i][right]-p[j][left]+p[i][left];
			int qsum=q[j][right]-q[i][right]-q[j][left]+q[i][left];
			if(psum==qsum){
				ans=max(ans,(j-i)*(right-left));
			}
		}
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Judge Result