Submission #1981334

---

Source Code Expand

#include <iostream>
using namespace std;

int main(){
    int H, W, ans = 0;
    cin >> H >> W;
    int chocolate[H+1][W+1];

    for(int i = 0; i <= H; ++i)
    for(int j = 0; j <= W; ++j){
        if(i == 0 || j == 0){
            chocolate[i][j] = 0;   
        }else{
            int a;
            cin >> a;
            chocolate[i][j] = i + j & 1 ? a : -a;
        }
    }


    for(int i = 0; i <= H; ++i)
    for(int j = 1; j <= W; ++j){
        chocolate[i][j] += chocolate[i][j-1];
    }

    for(int i = 1; i <= H; ++i)
    for(int j = 0; j <= W; ++j){
        chocolate[i][j] += chocolate[i-1][j];
    }

    for(int x1 = 1; x1 <= H; ++x1)
    for(int y1 = 1; y1 <= W; ++y1)
    for(int x2 = 0; x2 <= x1; ++x2)
    for(int y2 = 0; y2 <= y1; ++y2){
        if(chocolate[x1][y1] - chocolate[x1][y2] - chocolate[x2][y1] + chocolate[x2][y2] == 0){
            ans = max(ans, (x1-x2)*(y1-y2));
        }
    }

    cout << ans << endl;

    return 0;
}

Submission Info

Judge Result