feat: added alternative python solutions.

This commit is contained in:
2026-05-17 13:20:58 -03:00
parent 7e9caaea6e
commit c85571e157
451 changed files with 3777 additions and 3495 deletions

Binary file not shown.

Binary file not shown.

View File

@@ -1,7 +1,7 @@
\documentclass{maratona}
\begin{document}
\begin{ProblemaAutor}{}{Estouro}{1}{256}{Leetcode 312}
\begin{ProblemaAutor}{}{Estouro}{1.5}{256}{Leetcode 312}
No laboratório de experimentos caóticos da \textbf{Fábrica de Balões Numéricos}, um cientista excêntrico te entrega uma fileira de balões, cada um pintado com um número inteiro positivo.

View File

@@ -3,7 +3,7 @@
"problem": {
"title": "Estouro",
"event": "",
"time_limit": 1.0,
"time_limit": 1.5,
"memory_limit_mb": 256,
"input_file": "stdin",
"output_file": "stdout",
@@ -43,7 +43,7 @@
},
"solutions": {
"main-ac": "ac.cpp",
"alternative-ac": [],
"alternative-ac": ["alternative-ac.py"],
"wrong-answer": [],
"time-limit": [],
"time-limit-or-ac": [],

View File

@@ -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])