Submission #183608

---

Source Code Expand

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

int h,w;

int a[200][200], b[200][200];
int c[200][200], d[200][200];

int main(){
    cin >> h >> w;
    for(int i = 0; i < h; i++){
        for(int j = 0; j < w; j++){
            if(i+j&1){
                cin >> b[i][j];
            } else {
                cin >> a[i][j];
            }
        }
    }

    for(int i = 0; i < h; i++){
        for(int j = 0; j < w; j++){
            c[i+1][j+1] = c[i+1][j] + c[i][j+1] - c[i][j] + a[i][j];
            d[i+1][j+1] = d[i+1][j] + d[i][j+1] - d[i][j] + b[i][j];
        }
    }

    int ans = 0;
    for(int i = 0; i < h; i++){
        for(int j = i; j < h; j++){
            for(int k = 0; k < w; k++){
                for(int l = k; l < w; l++){
                    int c1 = c[j+1][l+1] - c[j+1][k] - c[i][l+1] + c[i][k];
                    int c2 = d[j+1][l+1] - d[j+1][k] - d[i][l+1] + d[i][k];
                    if(c1 == c2){
                        ans = max(ans, (j-i+1) * (l-k+1));
                    }
                }
            }
        }
    }

    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result