Submission #183601

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

const int MAX_L = 110;

int H, W;
int a[MAX_L][MAX_L];
int b[MAX_L][MAX_L];

int main() {
  cin >> H >> W;
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      cin >> a[i + 1][j + 1];
      if ((i + j) % 2 == 0) a[i + 1][j + 1] *= -1;
    }
  }
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      a[i + 1][j + 1] += a[i + 1][j];
    }
  }
  for (int i = 0; i <= W; i++) {
    for (int j = 0; j < H; j++) {
      a[j + 1][i] += a[j][i];
    }
  }
  int r = 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++) {
          if ((a[k][l] - a[i][l]) - (a[k][j] - a[i][j]) == 0) {
            r = max(r, (k - i) * (l - j));
          }
        }
      }
    }
  }
  cout << r << endl; 
}

Submission Info

Judge Result