Submission #1983164

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)   FOR(i,0,n)
#define pb emplace_back
#define mp make_pair
typedef long long ll;
typedef pair<int,int> pint;

int wb[102][102];
int main(){
    int h,w;
    cin>>h>>w;
    FOR(i,1,h+1)FOR(j,1,w+1){
        cin>>wb[i][j];
        if((i+j)%2==0)  wb[i][j]*=-1;
    }
    FOR(i,1,h+1)FOR(j,1,w+1){
        wb[i][j]+=wb[i-1][j]+wb[i][j-1]-wb[i-1][j-1];
    }
    int mx=0;
    FOR(lh,0,h)FOR(rh,lh+1,h+1)FOR(lw,0,w)FOR(rw,lw+1,w+1){
        if(wb[rh][rw]-wb[lh][rw]-wb[rh][lw]+wb[lh][lw]==0) mx=max(mx,(rh-lh)*(rw-lw));
    }
    cout<<mx<<endl;
    return 0;
}

Submission Info

Judge Result