Submission #3713080

---

Source Code Expand

#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <set>
#include <vector>
#include <map>
#include <list>
#include <stack>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <queue>
#define pr(num) cout << num << endl
#define max(a, b) ((a)>(b) ? (a):(b))
#define min(a, b) ((a)<(b) ? (a):(b))
#define INF 1000000000000000000
#define MOD 1000000007LL
#define MAX 100100
#define MAX_N 100100
#define MAX_LOG_N 25
#define NIL -1
#define WHITE 0
#define BLACK 1
using namespace std;
typedef long long ll;
typedef map<ll, ll> Map;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> P;

int main(void) {
    ll H, W;
    cin >> H >> W;
    ll i, j, I, J;
    ll c[110][110];
    ll s[110][110]={};
    
    for(i=1; i<=H; i++) {
        for(j=1; j<=W; j++) {
            cin >> c[i][j];
            if((i+j)%2==1) c[i][j]*=-1;
        }
    }
    
    s[1][1]=c[1][1];
    for(i=1; i<=H; i++) {
        for(j=1; j<=W; j++) {
            s[i][j]=c[i][j]+s[i-1][j]+s[i][j-1]-s[i-1][j-1];
        }
    }
    
    ll ans=0;
    for(I=1; I<=H; I++) {
        for(J=1; J<=W; J++) {
            for(i=0; i<I; i++) {
                for(j=0; j<J; j++) {
                    if(s[I][J]-s[I][j]-s[i][J]+s[i][j]==0)
                        ans=max(ans, (I-i)*(J-j));
                    
                    
                }
            }
        }
    }
    
    
    pr(ans);
    
    
}

Submission Info

Judge Result