Submission #1961500

---

Source Code Expand

#include <bits/stdc++.h>
typedef long long int ll;
#define FOR(i, a, b) for (ll i = (signed)(a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define EREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define MOD 1000000007
#define pb push_back
#define INF 93193111451418101
#define MIN -93193111451418101
#define EPS 1e-11
#define tp(a, b, c) make_tuple(a, b, c)
#define lb(a, b) lower_bound((a).begin(), (a).end(), (b))
#define ub(a, b) upper_bound((a).begin(), (a).end(), (b))
#define bitcnt(a) (ll) __builtin_popcount((a))
using namespace std;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef pair<ll, P> TP;
template <typename T> void fill_all(T &arr, const T &v) { arr = v; }
template <typename T, typename ARR> void fill_all(ARR &arr, const T &v) {
  for (auto &i : arr) {
    fill_all(i, v);
  }
}
//------------------変数-----------------------//

ll n;
ll h, w, white[200][200], black[200][200];
//-------------------関数----------------------//

void imos(ll grid[200][200]) {
  REP(i, h + 1) {
    REP(j, w) { grid[i][j + 1] += grid[i][j]; }
  }
  REP(i, w + 1) {
    REP(j, h) { grid[j + 1][i] += grid[j][i]; }
  }
}
ll calc(ll ly, ll lx, ll hy, ll hx) {
  ll White = white[hy][hx] - white[hy][lx] - white[ly][hx] + white[ly][lx];
  ll Black = black[hy][hx] - black[hy][lx] - black[ly][hx] + black[ly][lx];
  return (Black == White ? (hy - ly) * (hx - lx) : 0);
}
int main() {
  cin >> h >> w;
  REP(i, h) {
    REP(j, w) {
      if ((i + j) % 2 == 0)
        cin >> white[i + 1][j + 1];
      else
        cin >> black[i + 1][j + 1];
    }
  }
  imos(white);
  imos(black);
  ll maxa = 0;
  REP(i, h) {
    FOR(j, i + 1, h + 1) {
      REP(k, w) {
        FOR(l, k + 1, w + 1) { maxa = max(maxa, calc(i, k, j, l)); }
      }
    }
  }

  cout << maxa << endl;
}

Submission Info

Judge Result