Envío 6840
- Autor: NellerP21
- Fecha: 2023-01-02 03:01:39 UTC (Hace 28 días)
Caso # |
Resultado |
Tiempo |
Memoria |
#1 |

Correcto
|
0.005 s
|
3 KBi |
#2 |

Correcto
|
0.005 s
|
1 KBi |
#3 |

Correcto
|
0.005 s
|
4 KBi |
#4 |

Correcto
|
0.005 s
|
1 KBi |
#5 |

Correcto
|
0.006 s
|
3 KBi |
#6 |

Correcto
|
0.004 s
|
10 KBi |
#7 |

Correcto
|
0.006 s
|
1 KBi |
#8 |

Correcto
|
0.005 s
|
2 KBi |
#9 |

Correcto
|
0.007 s
|
1 KBi |
#10 |

Correcto
|
0.005 s
|
1 KBi |
#11 |

Correcto
|
0.008 s
|
1 KBi |
#12 |

Correcto
|
0.005 s
|
1 KBi |
#13 |

Correcto
|
0.007 s
|
1 KBi |
#14 |

Correcto
|
0.005 s
|
1 KBi |
#15 |

Correcto
|
0.004 s
|
1 KBi |
#16 |

Correcto
|
0.008 s
|
1 KBi |
#17 |

Correcto
|
0.004 s
|
1 KBi |
#18 |

Correcto
|
0.005 s
|
2 KBi |
#19 |

Correcto
|
0.005 s
|
1 KBi |
Puntos totales: 100 / 100
Código
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin>>n;
vector<long long> v(n);
for(int i = 0; i < n; ++i){
cin>>v[i];
}
long long ans = *max_element(v.begin(),v.end());
for(int i = 0; i < n; ++i){
long long minimo = v[i];
long long cont = 1ll;
for(int j = i + 1; j < n; ++j){
minimo = min(v[j],minimo); cont++;
ans = max(ans,minimo * cont);
}
}
cout << ans <<"\n";
return 0;
}