Envío 2168
Problema 0x94 - Subarreglo de máxima suma
- Autor: d4vsanchez
- Fecha: 2020-11-27 03:15:03 UTC (Hace alrededor de 4 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.024 s | 3 KBi |
| #2 |
Correcto
|
0.027 s | 3 KBi |
| #3 |
Correcto
|
0.026 s | 3 KBi |
| #4 |
Correcto
|
0.031 s | 3 KBi |
| #5 |
Correcto
|
0.025 s | 3 KBi |
| #6 |
Correcto
|
0.038 s | 3 KBi |
| #7 |
Correcto
|
0.034 s | 3 KBi |
| #8 |
Correcto
|
0.026 s | 3 KBi |
| #9 |
Correcto
|
0.026 s | 3 KBi |
| #10 |
Correcto
|
0.027 s | 3 KBi |
| #11 |
Correcto
|
0.027 s | 3 KBi |
| #12 |
Correcto
|
0.025 s | 3 KBi |
| #13 |
Correcto
|
0.035 s | 3 KBi |
| #14 |
Correcto
|
0.03 s | 3 KBi |
| #15 |
Correcto
|
0.036 s | 3 KBi |
| #16 |
Correcto
|
0.029 s | 3 KBi |
| #17 |
Correcto
|
0.098 s | 11 KBi |
| #18 |
Correcto
|
0.102 s | 11 KBi |
| #19 |
Correcto
|
0.115 s | 12 KBi |
| #20 |
Correcto
|
0.102 s | 12 KBi |
| #21 |
Correcto
|
0.099 s | 12 KBi |
| #22 |
Correcto
|
0.11 s | 11 KBi |
| #23 |
Correcto
|
0.105 s | 10 KBi |
| #24 |
Correcto
|
0.11 s | 11 KBi |
Puntos totales: 100 / 100
Código
def find_subarray_max_sum(arr):
largest_sum = float("-inf")
current_sum = 0
for n in arr:
current_sum = max(n, current_sum + n)
largest_sum = max(largest_sum, current_sum)
return largest_sum
def main():
_ = input()
arr = [int(x) for x in input().split()]
print(find_subarray_max_sum(arr))
main()