Envío 4450
Problema 0x94 - Subarreglo de máxima suma
- Autor: Jhon_z099
- Fecha: 2021-06-28 16:46:54 UTC (Hace más de 3 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.005 s | 7 KBi |
| #2 |
Correcto
|
0.007 s | 4 KBi |
| #3 |
Correcto
|
0.006 s | 2 KBi |
| #4 |
Correcto
|
0.004 s | 0 KBi |
| #5 |
Correcto
|
0.005 s | 4 KBi |
| #6 |
Correcto
|
0.005 s | 9 KBi |
| #7 |
Correcto
|
0.005 s | 10 KBi |
| #8 |
Correcto
|
0.004 s | 2 KBi |
| #9 |
Correcto
|
0.004 s | 13 KBi |
| #10 |
Correcto
|
0.006 s | 7 KBi |
| #11 |
Correcto
|
0.006 s | 8 KBi |
| #12 |
Correcto
|
0.006 s | 2 KBi |
| #13 |
Correcto
|
0.005 s | 4 KBi |
| #14 |
Correcto
|
0.005 s | 3 KBi |
| #15 |
Correcto
|
0.004 s | 14 KBi |
| #16 |
Correcto
|
0.005 s | 9 KBi |
| #17 |
Incorrecto
|
0.056 s | 5 KBi |
| #18 |
Correcto
|
0.044 s | 2 KBi |
| #19 |
Correcto
|
0.042 s | 29 KBi |
| #20 |
Incorrecto
|
0.04 s | 5 KBi |
| #21 |
Incorrecto
|
0.03 s | 5 KBi |
| #22 |
Incorrecto
|
0.044 s | 2 KBi |
| #23 |
Correcto
|
0.023 s | 3 KBi |
| #24 |
Correcto
|
0.02 s | 1 KBi |
Puntos totales: 84 / 100
Código
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<int> arr(n);
for(int &i: arr)cin >> i;
int curr, best; curr = best = -1e9 -1;
for(int i: arr){
curr= max(curr+i, i);
best = max(best, curr);
}
cout << best;
return 0;
}