Submission #1695214

---

Source Code Expand

//#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
// #define int ll
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define IN(a, b, x) (a<=x&&x<b)
#define MP make_pair
#define PB push_back
#ifdef int
const ll INF = (1LL<<60);
#else
const int INF = (1LL<<30);
#endif
const double PI = 3.14159265359;
const double EPS = 1e-12;
const int MOD = 1000000007;

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

struct ruisekiwa {
  int h, w, num, sum[2010][2010] = {};
  void init(int hh, int ww) {
    h = hh, w = ww;
    // 1-indexに
    for(int i=h-1; i>=0; --i) for(int j=w-1; j>=0; --j) {
      sum[i+1][j+1] = sum[i][j];
      sum[i][j] = 0;
    }
    // 二次元累積和をつくる
    FOR(i, 1, h+1) FOR(j, 1, w+1) sum[i][j] += sum[i-1][j] + sum[i][j-1] - sum[i-1][j-1];
  }

  // 0-indexで(sx, sy, gx, gy)の矩形範囲の和を求める
  int query(int sx, int sy, int gx, int gy) {
    return sum[gy+1][gx+1] - sum[gy+1][sx] - sum[sy][gx+1] + sum[sy][sx];
  }

  void debug() {
    cout << "------------------" << endl;
    REP(i, h) {
      REP(j, w) {
        cout << sum[i+1][j+1] << " ";
      }
      cout << endl;
    }
    cout << "------------------" << endl;
  }
};

ruisekiwa dp[2];
signed main(void)
{
  int h, w;
  cin >> h >> w;
  REP(i, h) REP(j, w) {
    if((i+j)%2) cin >> dp[0].sum[i][j];
    else cin >> dp[1].sum[i][j];
  }
  dp[0].init(h, w);
  dp[1].init(h, w);
  // dp[0].debug();
  // dp[1].debug();
  //
  // cout << dp[0].query(0, 0, 1, 1) << " " << dp[1].query(0, 0, 1, 1) << endl;

  ll ret = 0;
  REP(i, h) REP(j, w) FOR(k, i, h) FOR(l, j, w) {
    if(dp[0].query(j, i, l, k) == dp[1].query(j, i, l, k)) {
      // cout << i << " " << j << " " << k << " " << l << endl;
      chmax(ret, (l-j+1)*(k-i+1));
    }
  }
  cout << ret << endl;

  return 0;
}

Submission Info

Judge Result