Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.007 s | 2 KBi |
#2 |
Correcto
|
0.008 s | 2 KBi |
#3 |
Correcto
|
0.005 s | 1 KBi |
#4 |
Correcto
|
0.005 s | 2 KBi |
#5 |
Correcto
|
0.007 s | 2 KBi |
#6 |
Correcto
|
0.007 s | 2 KBi |
#7 |
Correcto
|
0.007 s | 1 KBi |
#8 |
Correcto
|
0.007 s | 2 KBi |
#9 |
Correcto
|
0.006 s | 2 KBi |
#10 |
Correcto
|
0.007 s | 1 KBi |
#11 |
Correcto
|
0.006 s | 2 KBi |
#12 |
Correcto
|
0.008 s | 2 KBi |
#13 |
Correcto
|
0.008 s | 2 KBi |
#14 |
Correcto
|
0.006 s | 1 KBi |
#15 |
Correcto
|
0.007 s | 2 KBi |
#16 |
Correcto
|
0.006 s | 1 KBi |
#17 |
Incorrecto
|
0.058 s | 1 KBi |
#18 |
Correcto
|
0.049 s | 2 KBi |
#19 |
Correcto
|
0.056 s | 2 KBi |
#20 |
Incorrecto
|
0.047 s | 2 KBi |
#21 |
Incorrecto
|
0.043 s | 1 KBi |
#22 |
Incorrecto
|
0.054 s | 2 KBi |
#23 |
Correcto
|
0.037 s | 1 KBi |
#24 |
Correcto
|
0.037 s | 1 KBi |
#include <iostream> #include <vector> using namespace std; int mayor (int a,int b); int main(){ int n; cin >> n; vector<int> a(n); for(int i =0;i<n;++i){ cin >> a[i]; } int maximo = a[0]; int maximo_local = a[0]; for(int j = 1;j<n;j++){ maximo_local = mayor(a[j],maximo_local+ a[j]); maximo = mayor(maximo,maximo_local); } cout << maximo << endl; return 0; } int mayor (int a,int b){ if(a>b){ return a; }else{ return b; } }