Envío 2192
- Autor: judavid.arias
- Fecha: 2020-11-28 22:22:47 UTC (Hace alrededor de 3 años)
Caso # |
Resultado |
Tiempo |
Memoria |
#1 |

Correcto
|
0.005 s
|
2 KBi |
#2 |

Correcto
|
0.005 s
|
1 KBi |
#3 |

Correcto
|
0.006 s
|
2 KBi |
#4 |

Correcto
|
0.006 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 |

Correcto
|
0.005 s
|
1 KBi |
#9 |

Correcto
|
0.004 s
|
1 KBi |
#10 |

Correcto
|
0.004 s
|
1 KBi |
#11 |

Correcto
|
0.005 s
|
2 KBi |
#12 |

Correcto
|
0.005 s
|
2 KBi |
#13 |

Correcto
|
0.006 s
|
2 KBi |
#14 |

Correcto
|
0.005 s
|
1 KBi |
#15 |

Correcto
|
0.005 s
|
1 KBi |
#16 |

Correcto
|
0.004 s
|
2 KBi |
#17 |

Incorrecto
|
0.062 s
|
2 KBi |
#18 |

Correcto
|
0.043 s
|
2 KBi |
#19 |

Correcto
|
0.071 s
|
2 KBi |
#20 |

Incorrecto
|
0.053 s
|
2 KBi |
#21 |

Incorrecto
|
0.036 s
|
2 KBi |
#22 |

Incorrecto
|
0.08 s
|
2 KBi |
#23 |

Correcto
|
0.03 s
|
2 KBi |
#24 |

Correcto
|
0.03 s
|
2 KBi |
Puntos totales: 84 / 100
Código
#include <iostream>
#include <algorithm> // std::max
#include <limits.h>
using namespace std;
int main() {
int N;
cin >> N;
int data[N];
int sums[N];
int resp = INT_MIN;
for(int i =0;i<N;i++){
cin >> data[i];
if(i==0){
sums[i] = data[i];
}else{
int tmp = data[i]+sums[i-1];
sums[i] = max(tmp, data[i]);
}
resp = max(resp, sums[i]);
}
cout << resp << endl;
return 0;
}