|
|
@ -13,12 +13,12 @@ int main() {
|
|
|
|
|
|
|
|
|
|
|
|
for (int j = 1; j <= n; j++)
|
|
|
|
for (int j = 1; j <= n; j++)
|
|
|
|
for (int i = 1; i <= n; i++)
|
|
|
|
for (int i = 1; i <= n; i++)
|
|
|
|
a[i][j] += a[i - 1][j];
|
|
|
|
s[i][j] = s[i - 1][j] + a[i][j];
|
|
|
|
|
|
|
|
|
|
|
|
for (int i = 1; i <= n; i++) {
|
|
|
|
for (int i = 1; i <= n; i++) {
|
|
|
|
for (int k = 1; k <= i; k++) {
|
|
|
|
for (int k = 1; k <= i; k++) {
|
|
|
|
for (int j = 1; j <= n; j++) {
|
|
|
|
for (int j = 1; j <= n; j++) {
|
|
|
|
int gap = a[i][j] - a[i - k][j];
|
|
|
|
int gap = s[i][j] - s[i - k][j];
|
|
|
|
dp[j] = max(dp[j - 1] + gap, gap);
|
|
|
|
dp[j] = max(dp[j - 1] + gap, gap);
|
|
|
|
ans = max(dp[j], ans);
|
|
|
|
ans = max(dp[j], ans);
|
|
|
|
}
|
|
|
|
}
|
|
|
|