Submission #1680209

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define imfor(i, n) for(int i = 0; i < n; i++)
using namespace std;
ll MOD = 1000000007;

int main() {
    int h, w;
    int c[110][110];
    cin >> h >> w;
    imfor(i, h) {
        imfor(j, w) {
            cin >> c[i][j];
            if ((i + j) % 2 == 0) {
                c[i][j] *= -1;
            }
        }
    }
    int area[110][110];
    for (int i = 0; i <= h - 1; i++) {
        for (int j = 0; j <= w - 1; j++) {
            if (i == 0 && j == 0) {
                area[i][j] = c[i][j];
            }
            else if (i == 0) {
                area[i][j] = area[i][j - 1] + c[i][j];
            }
            else if (j == 0) {
                area[i][j] = area[i - 1][j] + c[i][j];
            }
            else {
                area[i][j] = area[i - 1][j] + area[i][j - 1] - area[i - 1][j - 1] + c[i][j];
            }
        }
    }

    int ans = 0;
    for (int i = 0; i <= h - 1; i++) {
        for (int j = 0; j <= w - 1; j++) {
            for (int k = 0; k <= h - 1; k++) {
                for (int l = 0; l <= w - 1; l++) {
                    if (i > k || j > l) {
                        continue;
                    }
                    int tmp;
                    if (i == 0 && j == 0) {
                        tmp = area[k][l];
                    }
                    else if (i == 0) {
                        tmp = area[k][l] - area[k][j - 1];
                    }
                    else if (j == 0) {
                        tmp = area[k][l] - area[i - 1][l];
                    }
                    else {
                        tmp = area[k][l] - area[i - 1][l] - area[k][j - 1] + area[i - 1][j - 1];
                    }
                    if (tmp == 0) {
                        ans = max(ans, (k - i + 1) * (l - j + 1));
                    }
                }
            }
        }
    }
    cout << ans << endl;
}

Submission Info

Judge Result