Submission #1414568

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

int main(void) {
  int H, W;
  cin >> H >> W;

  int b[110][110] = {}, w[110][110] = {}, c;
  for (int i = 1; i <= H; i++) {
    for (int j = 1; j <= W; j++) {
      cin >> c;
      if ((i + j) % 2) w[i][j] = c;
      else b[i][j] = c;
    }
  }

  for (int i = 1; i <= H; i++) {
    for (int j = 1; j <= W; j++) {
      b[i][j] += b[i][j - 1] + b[i - 1][j] - b[i - 1][j - 1];
      w[i][j] += w[i][j - 1] + w[i - 1][j] - w[i - 1][j - 1];
    }
  }

  int black, white, ans = 0;
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      for (int k = i + 1; k <= H; k++) {
        for (int l = j + 1; l <= W; l++) {
          black = b[k][l] - b[i][l] - b[k][j] + b[i][j];
          white = w[k][l] - w[i][l] - w[k][j] + w[i][j];
          if (black == white) {
            ans = max(ans, (k - i) * (l - j));
          }
        }
      }
    }
  }

  cout << ans << endl;

  return 0;  
}

Submission Info

Judge Result