Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 1 KBi |
#2 |
Correcto
|
0.006 s | 1 KBi |
#3 |
Correcto
|
0.005 s | 1 KBi |
#4 |
Correcto
|
0.005 s | 1 KBi |
#5 |
Correcto
|
0.006 s | 1 KBi |
#6 |
Correcto
|
0.006 s | 1 KBi |
#7 |
Correcto
|
0.006 s | 1 KBi |
#8 |
Correcto
|
0.007 s | 1 KBi |
#9 |
Correcto
|
0.006 s | 1 KBi |
#10 |
Correcto
|
0.006 s | 1 KBi |
#11 |
Correcto
|
0.007 s | 1 KBi |
#12 |
Correcto
|
0.007 s | 1 KBi |
#13 |
Correcto
|
0.007 s | 1 KBi |
#14 |
Correcto
|
0.005 s | 1 KBi |
#15 |
Correcto
|
0.007 s | 1 KBi |
#16 |
Correcto
|
0.005 s | 1 KBi |
#17 |
Incorrecto
|
0.051 s | 1 KBi |
#18 |
Correcto
|
0.047 s | 1 KBi |
#19 |
Correcto
|
0.052 s | 1 KBi |
#20 |
Incorrecto
|
0.046 s | 1 KBi |
#21 |
Incorrecto
|
0.032 s | 1 KBi |
#22 |
Incorrecto
|
0.048 s | 1 KBi |
#23 |
Correcto
|
0.024 s | 1 KBi |
#24 |
Correcto
|
0.039 s | 1 KBi |
#include <iostream> #include <vector> using namespace std; int solve(const vector<int> &a) { int best = a[0]; int current = a[0]; for (int i = 1; i < a.size(); i++) { current = max(current + a[i], a[i]); best = max(best, current); } return best; } int main() { int n; cin >> n; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } int best = solve(a); cout << best << endl; return 0; }