Submission #1389947

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i,n) for(int i=0;i<(int)n;++i)

int main(){
    int H, W;
    cin >> H >> W;
    int C[H][W];
    REP(i, H){
        REP(j, W){
            int x;
            cin >> x;
            C[i][j] = ((i+j)%2==0?1:-1)*x;
        }
    }
    int cul[H+1][W+1] = {};
    REP(i, H){
        REP(j, W){
            cul[i+1][j+1] = cul[i+1][j] + C[i][j];
        }
    }
    REP(j, W){
        REP(i, H){
            cul[i+1][j+1] += cul[i][j+1];
        }
    }

    int res = 0;
    REP(i, H){
        REP(j, W){
            for(int k=i;k<H;k++){
                for (int l=j;l<W;l++){
                    if(cul[k+1][l+1]+cul[i][j]-cul[k+1][j]-cul[i][l+1]==0){
                        res = max(res, (k-i+1)*(l-j+1));
                    }
                }
            }
        }
    }
    cout << res << endl;
    return 0;
}

Submission Info

Judge Result