Envío 2308
Problema 0x94 - Subarreglo de máxima suma
- Autor: Felipe
- Fecha: 2020-12-13 01:32:36 UTC (Hace alrededor de 4 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.036 s | 7 KBi |
| #2 |
Correcto
|
0.027 s | 3 KBi |
| #3 |
Correcto
|
0.031 s | 3 KBi |
| #4 |
Correcto
|
0.026 s | 3 KBi |
| #5 |
Correcto
|
0.026 s | 3 KBi |
| #6 |
Correcto
|
0.031 s | 3 KBi |
| #7 |
Correcto
|
0.03 s | 3 KBi |
| #8 |
Correcto
|
0.025 s | 3 KBi |
| #9 |
Correcto
|
0.035 s | 3 KBi |
| #10 |
Correcto
|
0.03 s | 3 KBi |
| #11 |
Correcto
|
0.03 s | 3 KBi |
| #12 |
Correcto
|
0.03 s | 3 KBi |
| #13 |
Correcto
|
0.02 s | 3 KBi |
| #14 |
Correcto
|
0.025 s | 3 KBi |
| #15 |
Correcto
|
0.032 s | 3 KBi |
| #16 |
Correcto
|
0.025 s | 3 KBi |
| #17 |
Correcto
|
0.097 s | 11 KBi |
| #18 |
Correcto
|
0.13 s | 12 KBi |
| #19 |
Correcto
|
0.089 s | 12 KBi |
| #20 |
Correcto
|
0.108 s | 12 KBi |
| #21 |
Correcto
|
0.107 s | 12 KBi |
| #22 |
Correcto
|
0.086 s | 11 KBi |
| #23 |
Correcto
|
0.083 s | 11 KBi |
| #24 |
Correcto
|
0.105 s | 11 KBi |
Puntos totales: 100 / 100
Código
n = int(input())
s_arr = input().split(" ")
arr = [int(v) for v in s_arr]
overall_max = arr[0]
max_so_far_including_item = 0
for val in arr:
max_so_far_including_item = max( max_so_far_including_item + val, val)
if max_so_far_including_item > overall_max:
overall_max = max_so_far_including_item
print(overall_max)