Envío 2176
Problema 0x94 - Subarreglo de máxima suma
- Autor: Andres Ariza
- Fecha: 2020-11-27 04:35:18 UTC (Hace alrededor de 4 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.035 s | 3 KBi |
| #2 |
Correcto
|
0.031 s | 3 KBi |
| #3 |
Correcto
|
0.031 s | 3 KBi |
| #4 |
Correcto
|
0.031 s | 3 KBi |
| #5 |
Correcto
|
0.035 s | 3 KBi |
| #6 |
Correcto
|
0.026 s | 3 KBi |
| #7 |
Correcto
|
0.032 s | 3 KBi |
| #8 |
Correcto
|
0.028 s | 3 KBi |
| #9 |
Correcto
|
0.034 s | 3 KBi |
| #10 |
Correcto
|
0.028 s | 3 KBi |
| #11 |
Correcto
|
0.032 s | 3 KBi |
| #12 |
Correcto
|
0.028 s | 3 KBi |
| #13 |
Correcto
|
0.036 s | 3 KBi |
| #14 |
Correcto
|
0.029 s | 3 KBi |
| #15 |
Correcto
|
0.036 s | 3 KBi |
| #16 |
Correcto
|
0.027 s | 3 KBi |
| #17 |
Correcto
|
0.135 s | 11 KBi |
| #18 |
Correcto
|
0.148 s | 11 KBi |
| #19 |
Correcto
|
0.15 s | 12 KBi |
| #20 |
Correcto
|
0.131 s | 12 KBi |
| #21 |
Correcto
|
0.146 s | 11 KBi |
| #22 |
Correcto
|
0.189 s | 11 KBi |
| #23 |
Correcto
|
0.174 s | 11 KBi |
| #24 |
Correcto
|
0.138 s | 11 KBi |
Puntos totales: 100 / 100
Código
N = int(input())
A = [int(n) for n in input().split()]
curr_sum = 0
sum_total = float('-inf')
for i in range(N):
curr_sum += A[i]
curr_sum = max(A[i], curr_sum)
sum_total = max(sum_total, curr_sum)
print(sum_total)