Submission #1693645

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e12;

int c[110][110];
int b[110][110];
int w[110][110];

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int H, W;
    cin >> H >> W;
    rep(i, 1, H + 1){
        rep(j, 1, W + 1){
            cin >> c[i][j];
            if((i + j) % 2){
                b[i][j] = c[i][j];
            }else{
                w[i][j] = c[i][j];
            }
        }
    }
    rep(i, 1, H + 1){
        rep(j, 1, W + 1){
            b[i][j] += b[i][j - 1];
            w[i][j] += w[i][j - 1];
        }
    }
    rep(i, 1, W + 1){
        rep(j, 1, H + 1){
            b[j][i] += b[j - 1][i];
            w[j][i] += w[j - 1][i];
        }
    }
    // rep(i, 1, H + 1){
    //     rep(j, 1, W + 1){
    //         cout << w[i][j] << " " ;
    //     }
    //     cout << endl;
    // }
    int MAX = 0;
    rep(i, 1, H + 1){
        rep(j, i, H + 1){
            rep(k, 1, W + 1){
                rep(l, k, W + 1){
                    int black = b[j][l] - b[j][k - 1] - b[i - 1][l] + b[i - 1][k - 1];
                    int white = w[j][l] - w[j][k - 1] - w[i - 1][l] + w[i - 1][k - 1];
                    // cout << i << ' ' << k << ' ' << j << ' ' << l << " : " << black << " " << white << endl; 
                    if(black == white){
                        int sz = (j - i + 1) * (l - k + 1);
                        chmax(MAX, sz);
                    }
                }
            }
        }
    }
    cout << MAX << endl;
}

Submission Info

Judge Result