Update

Author: ThanhNIT

src/main/java/g3001_3100/s3077_maximum_strength_of_k_disjoint_subarrays/Solution.java

@@ -27,7 +27,9 @@ public long maximumStrength(int[] n, int k) {
                 pm = -pm;
                 dp[i][j] = Math.max(dp[i - 1][j], dp[i - 1][j - 1]) + ((long) k - j) * n[i] * pm;
             }
-            if (max < dp[i][k - 1]) max = dp[i][k - 1];
+            if (max < dp[i][k - 1]) {
+                max = dp[i][k - 1];
+            }
         }
         return max;
     }