Submission #1440840

---

Source Code Expand

#include <bits/stdc++.h>
#define repeat(i, n) for( int i = 0; (i) < (n); ++(i) )
#define repeat_to(i, n) for( int i = 0; (i) <= (n); ++(i) )
#define repeat_from(i, m, n) for( int i = (m); (i) < (n); ++(i) )
#define repeat_from_to(i, m, n) for( int i = (m); (i) <= (n); ++(i) )
#define repeat_from_reverse(i, m, n) for( int i = (n) - 1; (i) >= (m); --(i) )
#define dump(x) cout << " " << #x << "=" << x
#define vdump(v) for(size_t t=0; t<v.size(); ++t){cout << " " << #v << "[" << t << "]=" << v[t];} cout << endl
using namespace std;
using lint = long long;

int main(void) {
    int h, w;
    cin >> h >> w;
    vector<vector<int>> choco(h, vector<int>(w));
    repeat(i, h) {
        repeat(j, w) {
            cin >> choco[i][j];
            if( (i+j) % 2 ) choco[i][j] = -choco[i][j];
        }
    }
    
    vector<vector<int>> cumul(h+1, vector<int>(w+1, 0));
    repeat_from_to(i, 1, h) {
        repeat_from_to(j, 1, w) {
            cumul[i][j] = cumul[i-1][j] + cumul[i][j-1] - cumul[i-1][j-1] + choco[i-1][j-1];
        }
    }
   
    /*
    repeat_from(i, 0, h) {
        repeat_from(j, 0, w) {
            cout << choco[i][j] << " ";
        }
        cout << endl;
    }
    
    repeat_from_to(i, 0, h) {
        repeat_from_to(j, 0, w) {
            cout << cumul[i][j] << " ";
        }
        cout << endl;
    }
    */
    
    int ans = 0;
    repeat_from_to(i, 0, h-1) {
        repeat_from_to(j, 0, w-1) {
            repeat_from_to(k, i+1, h) {
                repeat_from_to(l, j+1, w) {
                    if(cumul[k][l] - cumul[k][j] - cumul[i][l] + cumul[i][j] == 0) ans = max(ans, (k-i)*(l-j));
                }
            }
        }
    }
    cout << ans << endl;
    return 0;
                
}

Submission Info

Judge Result