Envío 4749
Problema 0x94 - Subarreglo de máxima suma
- Autor: Ikerlb
- Fecha: 2021-08-13 05:28:52 UTC (Hace más de 3 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.021 s | 3 KBi |
| #2 |
Incorrecto
|
0.02 s | 3 KBi |
| #3 |
Correcto
|
0.021 s | 3 KBi |
| #4 |
Correcto
|
0.023 s | 3 KBi |
| #5 |
Correcto
|
0.019 s | 3 KBi |
| #6 |
Correcto
|
0.021 s | 3 KBi |
| #7 |
Correcto
|
0.023 s | 3 KBi |
| #8 |
Incorrecto
|
0.023 s | 3 KBi |
| #9 |
Correcto
|
0.023 s | 3 KBi |
| #10 |
Correcto
|
0.02 s | 3 KBi |
| #11 |
Correcto
|
0.022 s | 3 KBi |
| #12 |
Correcto
|
0.022 s | 3 KBi |
| #13 |
Correcto
|
0.02 s | 3 KBi |
| #14 |
Correcto
|
0.022 s | 3 KBi |
| #15 |
Correcto
|
0.028 s | 3 KBi |
| #16 |
Correcto
|
0.021 s | 3 KBi |
| #17 |
Correcto
|
0.09 s | 11 KBi |
| #18 |
Incorrecto
|
0.092 s | 11 KBi |
| #19 |
Incorrecto
|
0.091 s | 12 KBi |
| #20 |
Correcto
|
0.093 s | 12 KBi |
| #21 |
Correcto
|
0.092 s | 12 KBi |
| #22 |
Correcto
|
0.091 s | 11 KBi |
| #23 |
Correcto
|
0.095 s | 11 KBi |
| #24 |
Correcto
|
0.09 s | 11 KBi |
Puntos totales: 84 / 100
Código
def max_subarray_sum(arr):
res = cur = 0
for n in arr:
cur = max(cur + n, n)
res = max(res, cur)
return res
if __name__ == "__main__":
N = int(input())
arr = list(map(int, input().split(" ")))
print(max_subarray_sum(arr))