Submission #3641487

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cmath>
#include <iomanip>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cassert>

using namespace std;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())

typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> V;
typedef map<int, int> M;

constexpr ll INF = 1e18;
constexpr ll MOD = 1e9 + 7;
constexpr double PI = 3.14159265358979323846;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int h, w, b[110][110] = {0}, s[110][110] = {0};

    cin >> h >> w;
    REP(i, h)
    REP(j, w)
    {

        if ((i + j) % 2 == 0)
            cin >> b[i + 1][j + 1];
        else
            cin >> s[i + 1][j + 1];

        if (j > 0)
        {
            b[i + 1][j + 1] += b[i + 1][j];
            s[i + 1][j + 1] += s[i + 1][j];
        }
    }

    FOR(i, 1, h + 1)
    REP(j, w + 1)
    {
        b[i][j] += b[i - 1][j];
        s[i][j] += s[i - 1][j];
    }

    int res = 0;
    REP(i, h)
    REP(j, w)
    {
        for (int k = 0; k <= i; k++)
            for (int l = 0; l <= j; l++)
            {
                int b_ = b[i + 1][j + 1] + b[k][l] - b[i + 1][l] - b[k][j + 1];
                int s_ = s[i + 1][j + 1] + s[k][l] - s[i + 1][l] - s[k][j + 1];

                if (b_ == s_)
                {
                    res = max(res, (i + 1 - k) * (j + 1 - l));
                }
            }
    }

    cout << res << endl;

    return 0;
}

Submission Info

Judge Result