Submission #3640413

---

Source Code Expand

#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
//
#define int long long
#define m0(x) memset((x), 0, sizeof(x))
#define mm(x) memset((x), -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
#define UNIQUE(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
// bit_macro
#define bit(n) (1LL << (n))
#define bitset(a, b) (a) |= (1 << (b))
#define bitunset(a, b) (a) |= ~(1 << (b))
#define bitcheck(a, b) ((a) >> (b)) & 1
#define bitcount(a) __builtin_popcountll((a))
//
typedef pair<int, int> P;
typedef tuple<int, int, int> TP;
typedef vector<int> vec;
typedef vector<vec> mat;
//
const int INF = (int)1e18;
const int MOD = (int)1e9 + 7;
const double EPS = (double)1e-10;
const int dx[] = {-1, 0, 0, 1, 0};
const int dy[] = {0, -1, 1, 0, 0};
//
template <typename T> void chmax(T &a, T b) { a = max(a, b); }
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
//
struct Accelerate_Cin {
  Accelerate_Cin() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(20);
  };
};

int H, W;
int C[110][110];
int imos[110][110];

signed main() {
  cin >> H >> W;
  for (int i = 1; i <= H; i++) {
    for (int j = 1; j <= W; j++) {
      int tmp;
      cin >> tmp;
      if ((i + j) % 2 == 1) {
        tmp *= -1;
      }

      C[i][j] = tmp;
      imos[i][j] = tmp;
    }
  }

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

  int ans = 0;
  for (int h = 1; h <= H; h++) {
    for (int nh = 1; nh <= H; nh++) {
      for (int w = 1; w <= W; w++) {
        for (int nw = 1; nw <= W; nw++) {
          int sum = 0;
          sum += imos[nh][nw];
          sum -= imos[h - 1][nw] + imos[nh][w - 1];
          sum += imos[h - 1][w - 1];

          if (sum == 0) {
            int S = (nh - h + 1) * (nw - w + 1);
            chmax(ans, S);
          }
        }
      }
    }
  }

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

Submission Info

Judge Result