Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.027 s | 3 KBi |
#2 |
Correcto
|
0.021 s | 3 KBi |
#3 |
Correcto
|
0.011 s | 3 KBi |
#4 |
Correcto
|
0.007 s | 3 KBi |
#5 |
Correcto
|
0.021 s | 3 KBi |
#6 |
Correcto
|
0.008 s | 3 KBi |
#7 |
Correcto
|
0.022 s | 3 KBi |
#8 |
Incorrecto
|
0.021 s | 3 KBi |
#9 |
Incorrecto
|
0.035 s | 3 KBi |
#10 |
Correcto
|
0.025 s | 3 KBi |
#11 |
Incorrecto
|
0.022 s | 3 KBi |
#12 |
Incorrecto
|
0.029 s | 3 KBi |
#13 |
Incorrecto
|
0.022 s | 3 KBi |
#14 |
Correcto
|
0.026 s | 3 KBi |
#15 |
Incorrecto
|
0.008 s | 3 KBi |
#16 |
Incorrecto
|
0.027 s | 3 KBi |
#17 |
Incorrecto
|
0.024 s | 3 KBi |
#18 |
Incorrecto
|
0.029 s | 3 KBi |
#19 |
Incorrecto
|
0.022 s | 3 KBi |
N = input() edifs = list(map(int, input().split(' '))) area = 0 for i in range(len(edifs)): for j in range(i, len(edifs)): if edifs[j] >= edifs[i]: area = max(area, edifs[i] * (j-i+1)) #print(f'{edifs[i]} {(j-i+1)}') #print(f'area: {area}') print(area)