Submission #1371036

---

Source Code Expand

#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i=a; i<b; i++)
#define REP(i,n) FOR(i,0,n)

//#define int long long
typedef long long ll;
const ll INF = 1e18;
using namespace std;

int black[110][110], white[110][110];

signed main()
{
    int H, W;
    int C;

    cin >> H >> W;
    for (int i=1; i<=H; i++) {
        int black_sum = 0, white_sum = 0;
        for (int j=1; j<=W; j++) {
            cin >> C;
            if ((i + j) % 2 == 0) {
                black_sum += C;
            } else {
                white_sum += C;
            }
            black[i][j] = black_sum;
            white[i][j] = white_sum;
            if (i > 1) {
                black[i][j] += black[i-1][j];
                white[i][j] += white[i-1][j];
            }
        }
    }

    int ans = 0;
    for (int y=1; y<=H; y++) {
        for (int x=1; x<=W; x++) {
            for (int yy=y; yy<=H; yy++) {
                for (int xx=x; xx<=W; xx++) {
                    int black_sum = black[yy][xx] - black[yy][x-1] - black[y-1][xx] + black[y-1][x-1];
                    int white_sum = white[yy][xx] - white[yy][x-1] - white[y-1][xx] + white[y-1][x-1];
                    if (black_sum == white_sum) {
                        ans = max(ans, (yy - y + 1) * (xx - x + 1));
                    }
                }
            }
        }
    }

    cout << ans << endl;
}

Submission Info

Judge Result