Envío 4169
Problema 0x94 - Subarreglo de máxima suma
- Autor: Serivt
- Fecha: 2021-05-24 18:07:24 UTC (Hace más de 3 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.019 s | 3 KBi |
| #2 |
Correcto
|
0.022 s | 3 KBi |
| #3 |
Correcto
|
0.033 s | 3 KBi |
| #4 |
Correcto
|
0.019 s | 3 KBi |
| #5 |
Correcto
|
0.026 s | 3 KBi |
| #6 |
Correcto
|
0.023 s | 3 KBi |
| #7 |
Correcto
|
0.023 s | 3 KBi |
| #8 |
Correcto
|
0.017 s | 3 KBi |
| #9 |
Correcto
|
0.027 s | 3 KBi |
| #10 |
Correcto
|
0.026 s | 3 KBi |
| #11 |
Correcto
|
0.02 s | 3 KBi |
| #12 |
Correcto
|
0.022 s | 3 KBi |
| #13 |
Correcto
|
0.025 s | 3 KBi |
| #14 |
Correcto
|
0.021 s | 3 KBi |
| #15 |
Correcto
|
0.02 s | 3 KBi |
| #16 |
Correcto
|
0.024 s | 3 KBi |
| #17 |
Correcto
|
0.137 s | 12 KBi |
| #18 |
Correcto
|
0.175 s | 12 KBi |
| #19 |
Correcto
|
0.133 s | 12 KBi |
| #20 |
Correcto
|
0.144 s | 12 KBi |
| #21 |
Correcto
|
0.131 s | 11 KBi |
| #22 |
Correcto
|
0.143 s | 11 KBi |
| #23 |
Correcto
|
0.139 s | 11 KBi |
| #24 |
Correcto
|
0.145 s | 11 KBi |
Puntos totales: 100 / 100
Código
# Dynamic programming
n = int(input())
a = [int(i) for i in input().split()]
dp = [0] * len(a)
dp[0] = a[0]
best = dp[0]
for i in range(1, n):
dp[i] = max(a[i], dp[i -1] + a[i])
best = max(best, dp[i])
print(best)