Submission #1550308

---

Source Code Expand

#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <sstream>
#include <algorithm>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <list>
#include <cstdio>
#include <iostream>
#include <cmath>
#include <climits>
#include <bitset>
#include <functional>
#include <numeric>
#include <ctime>
#include <cassert>
#include <cstring>
#include <fstream>

#define rep(i, a, b) for(int (i)=(a); (i)<(b); (i)++)
#define irep(i, a, b) for(int (i)=(a);(i)<=(b);(i)++)
#define rrep(i, a, b) for(int (i)=(a);(i)>=(b);(i)--)

using namespace std;

const int MOD = 1e9 + 7;

int main() {
    int h, w;
    cin >> h >> w;
    vector<vector<int>> dat(h + 1, vector<int>(w + 1));
    rep(i, 0, h) {
        rep(j, 0, w) {
            cin >> dat[i + 1][j + 1];
            if ((i + j) % 2)
                dat[i+1][j+1] *= -1;
        }
    }

    vector<vector<int>> accum(h + 1, vector<int>(w + 1, 0));

    irep(i, 1, h) {
        accum[i][1] = accum[i - 1][1] + dat[i][1];
    }
    irep(j, 1, w) {
        accum[1][j] = accum[1][j - 1] + dat[1][j];
    }

    irep(i, 2, h) {
        irep(j, 2, w) {
            accum[i][j] = accum[i][j - 1] + accum[i - 1][j] - accum[i - 1][j - 1] + dat[i][j];
        }
    }


    int maxx = 0;
    irep(i1, 1, h) {
        irep(j1, 1, w) {
            irep(i2, i1, h) {
                irep(j2, j1, w) {
                    int ret = accum[i2][j2] - accum[i1-1][j2] - accum[i2][j1-1] + accum[i1-1][j1-1];
                    if (ret == 0) {
                        maxx = max(maxx, (i2 - i1 + 1)*(j2 - j1 + 1));
                    }
                }
            }
        }
    }

    cout << maxx << endl;

    return 0;
}

Submission Info

Judge Result