/*************************************
* author: marvinthang *
* created: 18.01.2024 23:36:31 *
*************************************/
#include "soccer.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i-- > 0; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u)
#define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
#include "debug.h"
#else
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define DB(...) 23
#define db(...) 23
#define debug(...) 23
#endif
template <class U, class V> scan_op(pair <U, V>) { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b) { return a > b ? a = b, true : false; }
template <class A, class B> bool maximize(A &a, B b) { return a < b ? a = b, true : false; }
// end of template
int biggest_stadium(int N, vector <vector <int>> F) {
vector <int> dp(N), nxt_dp(N), heights(N, -1);
int res = 0;
vector <vector <int>> inHeight(N);
vector <int> left(N), right(N);
REP(r, N) {
REP(c, N) {
if (F[r][c]) {
heights[c] = -1;
dp[c] = 0;
} else inHeight[++heights[c]].push_back(c);
}
stack <int> st;
REP(i, N) {
while (!st.empty() && heights[st.top()] >= heights[i]) st.pop();
left[i] = st.empty() ? -1 : st.top();
st.push(i);
}
while (!st.empty()) st.pop();
REPD(i, N) {
while (!st.empty() && heights[st.top()] >= heights[i]) st.pop();
right[i] = st.empty() ? N : st.top();
st.push(i);
}
REP(h, N) {
for (int c: inHeight[h]) {
int len = right[c] - left[c] - 1;
dp[c] += len;
if (left[c] >= 0) maximize(dp[c], dp[left[c]] + len * (h - heights[left[c]]));
if (right[c] < N) maximize(dp[c], dp[right[c]] + len * (h - heights[right[c]]));
maximize(res, dp[c]);
}
inHeight[h].clear();
}
}
return res;
}
