Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.005 s | 1 KBi |
#2 |
Incorrecto
|
0.006 s | 1 KBi |
#3 |
Correcto
|
0.006 s | 1 KBi |
#4 |
Incorrecto
|
0.005 s | 1 KBi |
#5 |
Correcto
|
0.005 s | 1 KBi |
#6 |
Correcto
|
0.005 s | 1 KBi |
#7 |
Correcto
|
0.005 s | 1 KBi |
#8 |
Incorrecto
|
0.007 s | 1 KBi |
#9 |
Correcto
|
0.007 s | 1 KBi |
#10 |
Correcto
|
0.006 s | 1 KBi |
#11 |
Correcto
|
0.005 s | 1 KBi |
#12 |
Incorrecto
|
0.006 s | 1 KBi |
#13 |
Incorrecto
|
0.007 s | 1 KBi |
#14 |
Correcto
|
0.006 s | 1 KBi |
#15 |
Incorrecto
|
0.006 s | 1 KBi |
#16 |
Incorrecto
|
0.006 s | 1 KBi |
#17 |
Incorrecto
|
0.045 s | 2 KBi |
#18 |
Incorrecto
|
0.048 s | 2 KBi |
#19 |
Incorrecto
|
0.05 s | 2 KBi |
#20 |
Incorrecto
|
0.045 s | 2 KBi |
#21 |
Incorrecto
|
0.031 s | 2 KBi |
#22 |
Incorrecto
|
0.046 s | 2 KBi |
#23 |
Correcto
|
0.026 s | 2 KBi |
#24 |
Incorrecto
|
0.029 s | 2 KBi |
#include <iostream> #include <vector> using namespace std; int main() { int n; cin >> n; vector<int> a(n); vector<int> sum(n); int result = 0; int current; for (int i = 0; i < n; i++) { cin >> current; int new_possible = max(current, 0); result = max(result, new_possible); } cout << result << endl; return 0; }