Envío 3626
Problema 0x94 - Subarreglo de máxima suma
- Autor: jocarmp08
- Fecha: 2021-04-04 05:01:32 UTC (Hace alrededor de 3 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.031 s | 5 KBi |
| #2 |
Correcto
|
0.029 s | 8 KBi |
| #3 |
Correcto
|
0.031 s | 3 KBi |
| #4 |
Correcto
|
0.02 s | 3 KBi |
| #5 |
Correcto
|
0.029 s | 3 KBi |
| #6 |
Correcto
|
0.03 s | 4 KBi |
| #7 |
Correcto
|
0.024 s | 3 KBi |
| #8 |
Correcto
|
0.028 s | 3 KBi |
| #9 |
Correcto
|
0.028 s | 3 KBi |
| #10 |
Correcto
|
0.02 s | 3 KBi |
| #11 |
Correcto
|
0.033 s | 5 KBi |
| #12 |
Correcto
|
0.024 s | 3 KBi |
| #13 |
Correcto
|
0.024 s | 3 KBi |
| #14 |
Correcto
|
0.02 s | 3 KBi |
| #15 |
Correcto
|
0.028 s | 4 KBi |
| #16 |
Correcto
|
0.024 s | 3 KBi |
| #17 |
Correcto
|
0.106 s | 11 KBi |
| #18 |
Correcto
|
0.151 s | 11 KBi |
| #19 |
Correcto
|
0.133 s | 12 KBi |
| #20 |
Correcto
|
0.124 s | 12 KBi |
| #21 |
Correcto
|
0.107 s | 11 KBi |
| #22 |
Correcto
|
0.105 s | 11 KBi |
| #23 |
Correcto
|
0.13 s | 11 KBi |
| #24 |
Correcto
|
0.132 s | 10 KBi |
Puntos totales: 100 / 100
Código
n = int(input())
array = [int(x) for x in input().split()]
best = array[0]
prev = array[0]
for i in range(1, n):
current = array[i]
prev = max(current, prev + array[i])
best = max(prev, best)
print(best)