Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.009 s | 3 KBi |
#2 |
Correcto
|
0.009 s | 3 KBi |
#3 |
Correcto
|
0.023 s | 3 KBi |
#4 |
Correcto
|
0.011 s | 3 KBi |
#5 |
Correcto
|
0.009 s | 3 KBi |
#6 |
Correcto
|
0.009 s | 3 KBi |
#7 |
Correcto
|
0.009 s | 3 KBi |
#8 |
Correcto
|
0.021 s | 3 KBi |
#9 |
Correcto
|
0.03 s | 3 KBi |
#10 |
Correcto
|
0.01 s | 3 KBi |
#11 |
Correcto
|
0.022 s | 3 KBi |
#12 |
Correcto
|
0.026 s | 3 KBi |
#13 |
Incorrecto
|
0.037 s | 3 KBi |
#14 |
Correcto
|
0.011 s | 3 KBi |
#15 |
Correcto
|
0.021 s | 3 KBi |
#16 |
Correcto
|
0.026 s | 3 KBi |
#17 |
Correcto
|
0.025 s | 3 KBi |
#18 |
Correcto
|
0.022 s | 3 KBi |
#19 |
Correcto
|
0.024 s | 3 KBi |
N = input() edifs = list(map(int, input().split(' '))) area = 0 for i in range(len(edifs)): j = i while j < len(edifs) and edifs[j] >= edifs[i]: area = max(area, edifs[i] * (j-i+1)) j += 1 index = len(edifs) - 1 for i in range(len(edifs)): index -= i j = index while j >= 0 and edifs[j] >= edifs[index]: area = max(area, edifs[index] * (index-j+1)) j -= 1 area = max(area, len(edifs) * min(edifs)) print(area)