Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.016 s | 3 KBi |
#2 |
Correcto
|
0.016 s | 3 KBi |
#3 |
Correcto
|
0.018 s | 3 KBi |
#4 |
Correcto
|
0.015 s | 3 KBi |
#5 |
Correcto
|
0.021 s | 3 KBi |
#6 |
Correcto
|
0.021 s | 3 KBi |
#7 |
Correcto
|
0.016 s | 3 KBi |
#8 |
Correcto
|
0.024 s | 3 KBi |
#9 |
Correcto
|
0.016 s | 3 KBi |
#10 |
Correcto
|
0.021 s | 3 KBi |
#11 |
Correcto
|
0.017 s | 3 KBi |
#12 |
Correcto
|
0.021 s | 3 KBi |
#13 |
Correcto
|
0.018 s | 3 KBi |
#14 |
Correcto
|
0.018 s | 3 KBi |
#15 |
Correcto
|
0.02 s | 3 KBi |
#16 |
Correcto
|
0.018 s | 3 KBi |
#17 |
Correcto
|
0.019 s | 3 KBi |
#18 |
Correcto
|
0.018 s | 3 KBi |
#19 |
Correcto
|
0.02 s | 3 KBi |
n = int(input()) elementsArray = [int(item) for item in input().split()] maxArea = 0 for position in range(0, n): y = elementsArray[position] x = 1 while (position + x) < n: if elementsArray[position + x] < y: y = elementsArray[position + x] x = x + 1 if (x * y) > maxArea: maxArea = x * y inicialArea = elementsArray[position] if inicialArea > maxArea: maxArea = inicialArea print(maxArea)