From 8616033a39bad9fbfbfcfe0d3d60b9ce08be8df3 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E9=BB=84=E6=B5=B7?= <10402852@qq.com>
Date: Mon, 18 Dec 2023 14:26:35 +0800
Subject: [PATCH] 'commit'

---
 TangDou/Topic/PrefixAndSuffix/P1719.cpp | 9 +++++----
 1 file changed, 5 insertions(+), 4 deletions(-)

diff --git a/TangDou/Topic/PrefixAndSuffix/P1719.cpp b/TangDou/Topic/PrefixAndSuffix/P1719.cpp
index 6e8ace8..2196122 100644
--- a/TangDou/Topic/PrefixAndSuffix/P1719.cpp
+++ b/TangDou/Topic/PrefixAndSuffix/P1719.cpp
@@ -8,13 +8,14 @@ int main() {
     for (int i = 1; i <= n; i++)
         for (int j = 1; j <= n; j++) {
             cin >> a[i][j];
-            s[i][j] = s[i - 1][j] + a[i][j];
+            s[i][j] = s[i - 1][j] + a[i][j]; // 利用一维前缀和，把当前第j列前面的1~j-1列的值，累加和压缩到第j列，每列都是如此处理
         }
 
-    for (int i = 1; i <= n; ++i) {
-        for (int j = 0; j < i; ++j) {
+    // O(N^3)算法
+    for (int i = 1; i <= n; i++) {
+        for (int j = 0; j < i; j++) {
             int _s = 0;
-            for (int k = 1; k <= n; ++k) {
+            for (int k = 1; k <= n; k++) {
                 _s = max(_s, 0) + s[i][k] - s[j][k];
                 res = max(res, _s);
             }