Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.006 s | 1 KBi |
#2 |
Correcto
|
0.007 s | 1 KBi |
#3 |
Correcto
|
0.006 s | 1 KBi |
#4 |
Correcto
|
0.006 s | 1 KBi |
#5 |
Correcto
|
0.006 s | 1 KBi |
#6 |
Correcto
|
0.007 s | 1 KBi |
#7 |
Correcto
|
0.006 s | 1 KBi |
#8 |
Correcto
|
0.006 s | 1 KBi |
#9 |
Correcto
|
0.006 s | 1 KBi |
#10 |
Correcto
|
0.006 s | 1 KBi |
#11 |
Correcto
|
0.006 s | 1 KBi |
#12 |
Correcto
|
0.007 s | 1 KBi |
#13 |
Correcto
|
0.007 s | 1 KBi |
#14 |
Correcto
|
0.007 s | 1 KBi |
#15 |
Correcto
|
0.008 s | 1 KBi |
#16 |
Correcto
|
0.007 s | 1 KBi |
#17 |
Correcto
|
0.059 s | 2 KBi |
#18 |
Correcto
|
0.06 s | 2 KBi |
#19 |
Correcto
|
0.051 s | 2 KBi |
#20 |
Correcto
|
0.044 s | 2 KBi |
#21 |
Correcto
|
0.043 s | 2 KBi |
#22 |
Correcto
|
0.06 s | 2 KBi |
#23 |
Correcto
|
0.031 s | 2 KBi |
#24 |
Correcto
|
0.034 s | 2 KBi |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<long> a(n); long max_sum = INT_MIN; for (int i = 0; i < n; i++) { cin >> a[i]; max_sum = max(max_sum, a[i]); } if (max_sum <= 0) { cout << max_sum << endl; return 0; } long sum = a[0]; for (int i = 1; i < n; i++) { sum = max(sum + a[i], a[i]); max_sum = max(max_sum, sum); } cout <<max_sum<<endl; }