feat: added alternative python solutions.

estouro/src/alternative-ac.py

@@ -0,0 +1,31 @@
+n = int(input())
+arr  = list(map(int, input().split()))
+
+nums = [1] + arr + [1]
+m = n + 2
+
+dp = [[0] * m for _ in range(m)]
+
+for length in range(2, m):
+    for left in range(m - length):
+        right = left + length
+
+        best = 0
+        left_val = nums[left]
+        right_val = nums[right]
+
+        row_left = dp[left]
+
+        for k in range(left + 1, right):
+            val = (
+                row_left[k]
+                + dp[k][right]
+                + left_val * nums[k] * right_val
+            )
+
+            if val > best:
+                best = val
+
+        row_left[right] = best
+
+print(dp[0][m - 1])