Submission #1352123

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
using namespace std;
int inf = 1000000000;

int calc(int y, int x, int y2, int x2, vector< vector<int> > c){
  int ret = 0;
  for(int i=y; i<=y+y2; i++){
    for(int j=x; j<=x+x2; j++){
      ret += c[i][j];
    }
  }
  return ret;
}

int main(void) {

  int h, w;
  cin >> h >> w;
  vector< vector<int> > c(h, vector<int> (w));
  for(int i=0; i<h; i++){
    for(int j=0; j<w; j++) cin >> c[i][j];
  }
  for(int i=0; i<h; i++){
    for(int j=0; j<w; j++){
      if( (i+j)%2 == 0 ) c[i][j] *= -1;
    }
  }
  int cnt = 0;
  for(int i=0; i<h; i++){
    for(int j=0; j<w; j++){
      for(int i2=0; i+i2<h; i2++){
        for(int j2=0; j+j2<w; j2++){

          int tmp = calc(i, j, i2, j2, c);
          if( tmp == 0 ) cnt = max(cnt, (i2+1)*(j2+1));

        }
      }

    }
  }
  cout << cnt << endl;

  return 0;
}





// EOF

Submission Info

Judge Result