Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.004 s | 1 KBi |
#2 |
Correcto
|
0.004 s | 21 KBi |
#3 |
Correcto
|
0.004 s | 22 KBi |
#4 |
Correcto
|
0.003 s | 1 KBi |
#5 |
Correcto
|
0.003 s | 26 KBi |
#6 |
Correcto
|
0.003 s | 21 KBi |
#7 |
Correcto
|
0.004 s | 3 KBi |
#8 |
Correcto
|
0.002 s | 1 KBi |
#9 |
Correcto
|
0.002 s | 1 KBi |
#10 |
Correcto
|
0.003 s | 1 KBi |
#11 |
Correcto
|
0.003 s | 13 KBi |
#12 |
Correcto
|
0.004 s | 4 KBi |
#13 |
Correcto
|
0.002 s | 7 KBi |
#14 |
Correcto
|
0.003 s | 1 KBi |
#15 |
Correcto
|
0.003 s | 1 KBi |
#16 |
Correcto
|
0.003 s | 17 KBi |
#17 |
Correcto
|
0.016 s | 1 KBi |
#18 |
Correcto
|
0.017 s | 1 KBi |
#19 |
Correcto
|
0.016 s | 1 KBi |
#20 |
Correcto
|
0.013 s | 1 KBi |
#21 |
Correcto
|
0.012 s | 1 KBi |
#22 |
Correcto
|
0.016 s | 2 KBi |
#23 |
Correcto
|
0.011 s | 1 KBi |
#24 |
Correcto
|
0.016 s | 1 KBi |
#include <stdio.h> long long max(long long a, long long b) { return a > b ? a : b; } int main() { int N; long long sumaActual = 0, sumaMax = -1000000000, num; scanf("%d", &N); // Kadane for (int i = 0; i < N; i++) { scanf(" %lld", &num); sumaActual = max(num, sumaActual + num); if (sumaActual > sumaMax) { sumaMax = sumaActual; } } printf("%lld\n", sumaMax); return 0; }