Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.003 s | 1 KBi |
#2 |
Correcto
|
0.005 s | 1 KBi |
#3 |
Correcto
|
0.004 s | 1 KBi |
#4 |
Correcto
|
0.004 s | 1 KBi |
#5 |
Correcto
|
0.004 s | 1 KBi |
#6 |
Correcto
|
0.005 s | 1 KBi |
#7 |
Correcto
|
0.004 s | 1 KBi |
#8 |
Correcto
|
0.004 s | 1 KBi |
#9 |
Correcto
|
0.004 s | 1 KBi |
#10 |
Correcto
|
0.004 s | 1 KBi |
#11 |
Correcto
|
0.005 s | 1 KBi |
#12 |
Correcto
|
0.005 s | 1 KBi |
#13 |
Correcto
|
0.003 s | 1 KBi |
#14 |
Correcto
|
0.005 s | 1 KBi |
#15 |
Correcto
|
0.005 s | 1 KBi |
#16 |
Correcto
|
0.005 s | 1 KBi |
#17 |
Correcto
|
0.02 s | 2 KBi |
#18 |
Correcto
|
0.022 s | 1 KBi |
#19 |
Correcto
|
0.03 s | 1 KBi |
#20 |
Correcto
|
0.024 s | 1 KBi |
#21 |
Correcto
|
0.015 s | 2 KBi |
#22 |
Correcto
|
0.017 s | 1 KBi |
#23 |
Correcto
|
0.019 s | 2 KBi |
#24 |
Correcto
|
0.015 s | 2 KBi |
#include<stdio.h> #define max(x,y) (x > y? x:y) #define ll long long int main(){ int n; scanf(" %d",&n); ll nums[n]; for(int i = 0; i < n;++i) scanf(" %lld",&nums[i]); ll ans = -100000000000LL; ll temp = 0; for(int i = 0; i < n;++i){ temp += nums[i]; ans = max(ans,temp); if(temp < 0) temp = 0; } printf("%lld\n",ans); return 0; }