#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a,b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a,b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
refs:
https://blog.brucemerry.org.za/2023/11/ioi-2023-day-1.html
*/
const int MOD = 1e9 + 7;
const int N = 2e3 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
#include "soccer.h"
template<typename T>
struct sparse_table {
/*============================*/
T merge(T a, T b) {
return max(a,b);
}
/*============================*/
vector<vector<T>> table;
vector<int> bin_log;
int LOG = 0;
sparse_table() {
}
sparse_table(vector<T> &a, int n) {
while ((1 << LOG) <= n) LOG++;
table = vector<vector<T>>(n, vector<T>(LOG));
bin_log = vector<int>(n + 1);
rep(i, n) table[i][0] = a[i];
rep1(j, LOG - 1) {
rep(i, n) {
int jump = 1 << (j - 1);
if (i + jump >= n) {
break;
}
table[i][j] = merge(table[i][j - 1], table[i + jump][j - 1]);
}
}
bin_log[1] = 0;
for (int i = 2; i <= n; ++i) {
bin_log[i] = bin_log[i / 2] + 1;
}
}
T query(int l, int r) {
int len = r - l + 1;
int k = bin_log[len];
T val1 = table[l][k];
T val2 = table[r - (1 << k) + 1][k];
return merge(val1, val2);
}
};
int mnl[N][N], mxr[N][N], mnu[N][N];
sparse_table<int> st1[N], st2[N];
int extendl(int i, int j, int c){
// int mx = -inf1;
// for(int r = i; r <= j; ++r){
// amax(mx,mnl[r][c]);
// }
// return mx;
return st1[c].query(i,j);
}
int extendr(int i, int j, int c){
// int mn = inf1;
// for(int r = i; r <= j; ++r){
// amin(mn,mxr[r][c]);
// }
// return mn;
return -st2[c].query(i,j);
}
const vector<ll> mul = {34828472,4838748374,894587283};
typedef unsigned long long ull;
struct hsh{
const ull RANDOM = mt19937_64(chrono::steady_clock::now().time_since_epoch().count())();
ull operator()(const array<int,3> &a) const {
ull val = a[0]*mul[0]+a[1]*mul[1]+a[2]*mul[2];
val ^= RANDOM;
return val;
}
};
int n;
gp_hash_table<array<int,3>,int,hsh> mp;
int go(int i, int j, int l){
if(i > j) return 0;
l = extendl(i,j,l);
int r = extendr(i,j,l);
array<int,3> ar = {i,j,l};
if(mp.find(ar) != mp.end()) return mp[ar];
int len = r-l+1;
// shrink j
int ans = len+go(i,j-1,l);
// shrink i till l expansion possible
if(l-1){
int p = mnu[j][l-1];
amax(ans,len*(p-i)+go(p,j,l));
}
// shrink i till r expansion possible
if(r+1 <= n){
int p = mnu[j][r+1];
amax(ans,len*(p-i)+go(p,j,l));
}
return mp[ar] = ans;
}
int biggest_stadium(int n_, std::vector<std::vector<int>> A)
{
n = n_;
int a[n+5][n+5];
memset(a,0,sizeof a);
rep1(i,n) rep1(j,n) a[i][j] = A[i-1][j-1];
rep1(i,n) mnl[i][0] = 1;
rep1(i,n){
rep1(j,n){
if(!a[i][j]){
mnl[i][j] = mnl[i][j-1];
}
else{
mnl[i][j] = j+1;
}
}
}
rep1(i,n) mxr[i][n+1] = n;
rev(j,n,1){
rep1(i,n){
if(!a[i][j]){
mxr[i][j] = mxr[i][j+1];
}
else{
mxr[i][j] = j-1;
}
}
}
rep1(j,n){
vector<int> b(n+5);
rep1(i,n) b[i] = mnl[i][j];
st1[j] = sparse_table<int>(b,n+1);
}
rep1(j,n){
vector<int> b(n+5);
rep1(i,n) b[i] = -mxr[i][j];
st2[j] = sparse_table<int>(b,n+1);
}
rep1(j,n) mnu[0][j] = 1;
rep1(i,n){
rep1(j,n){
if(!a[i][j]){
mnu[i][j] = mnu[i-1][j];
}
else{
mnu[i][j] = i+1;
}
}
}
int ans = 0;
vector<int> lx(n+5);
rep1(i,n){
rep1(j,n) lx[j] = 1;
stack<int> stk;
rev(j,n,1){
while(!stk.empty() and mnu[i][j] > mnu[i][stk.top()]){
int k = stk.top();
lx[k] = j+1;
stk.pop();
}
stk.push(j);
}
rep1(j,n){
amax(ans,go(mnu[i][j],i,lx[j]));
}
}
return ans;
}
