Envío 2334
Problema 0x94 - Subarreglo de máxima suma
- Autor: dagomez30
- Fecha: 2020-12-14 00:24:35 UTC (Hace alrededor de 4 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.033 s | 3 KBi |
| #2 |
Correcto
|
0.024 s | 3 KBi |
| #3 |
Correcto
|
0.024 s | 3 KBi |
| #4 |
Correcto
|
0.027 s | 3 KBi |
| #5 |
Correcto
|
0.03 s | 3 KBi |
| #6 |
Correcto
|
0.033 s | 3 KBi |
| #7 |
Correcto
|
0.021 s | 3 KBi |
| #8 |
Correcto
|
0.027 s | 7 KBi |
| #9 |
Correcto
|
0.03 s | 3 KBi |
| #10 |
Correcto
|
0.022 s | 3 KBi |
| #11 |
Correcto
|
0.023 s | 3 KBi |
| #12 |
Correcto
|
0.021 s | 3 KBi |
| #13 |
Correcto
|
0.033 s | 3 KBi |
| #14 |
Correcto
|
0.03 s | 3 KBi |
| #15 |
Correcto
|
0.025 s | 3 KBi |
| #16 |
Correcto
|
0.025 s | 3 KBi |
| #17 |
Correcto
|
0.118 s | 12 KBi |
| #18 |
Correcto
|
0.121 s | 11 KBi |
| #19 |
Correcto
|
0.106 s | 12 KBi |
| #20 |
Correcto
|
0.121 s | 12 KBi |
| #21 |
Correcto
|
0.112 s | 11 KBi |
| #22 |
Correcto
|
0.164 s | 12 KBi |
| #23 |
Correcto
|
0.152 s | 11 KBi |
| #24 |
Correcto
|
0.121 s | 11 KBi |
Puntos totales: 100 / 100
Código
def find(a):
n = len(a)
suma = 0
best = a[0]
smallest = 0
for j in range(n):
suma += a[j]
best = max(best, suma - smallest)
smallest = min(smallest, suma)
return best
n = int(input())
a = [int(x) for x in input().split()]
print(find(a))