Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.006 s | 1 KBi |
#2 |
Correcto
|
0.006 s | 1 KBi |
#3 |
Correcto
|
0.006 s | 1 KBi |
#4 |
Correcto
|
0.006 s | 1 KBi |
#5 |
Correcto
|
0.005 s | 2 KBi |
#6 |
Correcto
|
0.004 s | 1 KBi |
#7 |
Correcto
|
0.004 s | 1 KBi |
#8 |
Correcto
|
0.007 s | 1 KBi |
#9 |
Correcto
|
0.005 s | 1 KBi |
#10 |
Correcto
|
0.005 s | 2 KBi |
#11 |
Correcto
|
0.006 s | 1 KBi |
#12 |
Correcto
|
0.006 s | 2 KBi |
#13 |
Correcto
|
0.006 s | 1 KBi |
#14 |
Correcto
|
0.006 s | 1 KBi |
#15 |
Correcto
|
0.006 s | 1 KBi |
#16 |
Correcto
|
0.007 s | 1 KBi |
#17 |
Correcto
|
0.049 s | 2 KBi |
#18 |
Correcto
|
0.064 s | 2 KBi |
#19 |
Correcto
|
0.05 s | 2 KBi |
#20 |
Correcto
|
0.046 s | 2 KBi |
#21 |
Correcto
|
0.047 s | 2 KBi |
#22 |
Correcto
|
0.052 s | 2 KBi |
#23 |
Correcto
|
0.026 s | 1 KBi |
#24 |
Correcto
|
0.039 s | 2 KBi |
#include <vector> #include <iostream> #include <limits> using namespace std; int main() { int n; cin >> n; vector<long long> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } long long best = a[0]; long long sum = 0; long long smallest = 0; for (int j = 0; j < n; j++) { sum += a[j]; best = max(best, sum - smallest); smallest = min(smallest, sum); } cout << best << endl; return 0; }