Envío 5572
Problema 0x4f - Rectángulo de máxima área dentro de un histograma pequeño
- Autor: bryancalisto
- Fecha: 2022-01-10 00:24:08 UTC (Hace casi 3 años)
| Caso # | Resultado | Tiempo | Memoria |
|---|---|---|---|
| #1 |
Correcto
|
0.032 s | 6 KBi |
| #2 |
Correcto
|
0.026 s | 3 KBi |
| #3 |
Correcto
|
0.026 s | 5 KBi |
| #4 |
Correcto
|
0.027 s | 3 KBi |
| #5 |
Correcto
|
0.024 s | 3 KBi |
| #6 |
Correcto
|
0.016 s | 3 KBi |
| #7 |
Correcto
|
0.027 s | 6 KBi |
| #8 |
Correcto
|
0.026 s | 7 KBi |
| #9 |
Correcto
|
0.024 s | 3 KBi |
| #10 |
Correcto
|
0.025 s | 3 KBi |
| #11 |
Correcto
|
0.025 s | 3 KBi |
| #12 |
Correcto
|
0.023 s | 3 KBi |
| #13 |
Correcto
|
0.039 s | 3 KBi |
| #14 |
Correcto
|
0.022 s | 3 KBi |
| #15 |
Correcto
|
0.032 s | 3 KBi |
| #16 |
Correcto
|
0.029 s | 3 KBi |
| #17 |
Correcto
|
0.035 s | 3 KBi |
| #18 |
Correcto
|
0.034 s | 3 KBi |
| #19 |
Correcto
|
0.028 s | 3 KBi |
Puntos totales: 100 / 100
Código
N = int(input())
edifs = list(map(int, input().split(' ')))
area = 0
for i in range(N):
area = max(area, edifs[i])
localMin = 100000
for j in range(i + 1, N):
localMin = min(localMin, edifs[j])
newArea = min(localMin, min(edifs[i], edifs[j])) * ((j-i)+1)
area = max(area, newArea)
print(area)