Submission #3236638

---

Source Code Expand

#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	int h, w;
  cin>>h>>w;
  int s1[101][101]={}, s2[101][101]={};
  for(int i=1; i<=h; i++){
    for(int j=1; j<=w; j++){
      int c; cin>>c;
      if((i+j)%2){
        s1[i][j]=s1[i-1][j]+s1[i][j-1]-s1[i-1][j-1]+c;
        s2[i][j]=s2[i-1][j]+s2[i][j-1]-s2[i-1][j-1];
      }else{
        s1[i][j]=s1[i-1][j]+s1[i][j-1]-s1[i-1][j-1];
        s2[i][j]=s2[i-1][j]+s2[i][j-1]-s2[i-1][j-1]+c;
      }
    }
  }
  int ans=0;
  for(int a=0; a<h; a++){
    for(int b=a+1; b<=h; b++){
      for(int c=0; c<w; c++){
        for(int d=c+1; d<=w; d++){
          if(s1[b][d]-s1[a][d]-s1[b][c]+s1[a][c]==s2[b][d]-s2[a][d]-s2[b][c]+s2[a][c]){
            ans=max(ans, (b-a)*(d-c));
          }
        }
      }
    }
  }
  cout<<ans<<endl;
	return 0;
}

Submission Info

Judge Result