Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.007 s | 1 KBi |
#2 |
Incorrecto
|
0.006 s | 1 KBi |
#3 |
Correcto
|
0.006 s | 1 KBi |
#4 |
Correcto
|
0.005 s | 2 KBi |
#5 |
Correcto
|
0.006 s | 1 KBi |
#6 |
Correcto
|
0.005 s | 2 KBi |
#7 |
Correcto
|
0.006 s | 1 KBi |
#8 |
Incorrecto
|
0.005 s | 1 KBi |
#9 |
Correcto
|
0.006 s | 1 KBi |
#10 |
Correcto
|
0.005 s | 2 KBi |
#11 |
Correcto
|
0.005 s | 2 KBi |
#12 |
Correcto
|
0.005 s | 1 KBi |
#13 |
Correcto
|
0.005 s | 1 KBi |
#14 |
Correcto
|
0.006 s | 2 KBi |
#15 |
Correcto
|
0.007 s | 1 KBi |
#16 |
Correcto
|
0.005 s | 1 KBi |
#17 |
Incorrecto
|
0.044 s | 2 KBi |
#18 |
Incorrecto
|
0.051 s | 2 KBi |
#19 |
Incorrecto
|
0.055 s | 2 KBi |
#20 |
Incorrecto
|
0.06 s | 2 KBi |
#21 |
Incorrecto
|
0.044 s | 2 KBi |
#22 |
Incorrecto
|
0.054 s | 2 KBi |
#23 |
Correcto
|
0.028 s | 2 KBi |
#24 |
Correcto
|
0.029 s | 2 KBi |
#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int cases, x, num_max = 0; cin >> cases; vector <int> numbers; while ( cases-- ){ cin >> x; numbers.push_back(x); num_max = max(num_max, x); } if(num_max <= 0){ cout << num_max << endl; return 0; } int sum = numbers[0], sum_max = 0; for(int i=1;i<numbers.size(); i++){ sum = max(sum + numbers[i], numbers[i]); num_max = max(num_max, sum); } cout << num_max << endl; return 0; }