Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.023 s | 3 KBi |
#2 |
Incorrecto
|
0.01 s | 3 KBi |
#3 |
Incorrecto
|
0.026 s | 3 KBi |
#4 |
Incorrecto
|
0.02 s | 3 KBi |
#5 |
Incorrecto
|
0.019 s | 4 KBi |
#6 |
Incorrecto
|
0.019 s | 3 KBi |
#7 |
Incorrecto
|
0.007 s | 3 KBi |
#8 |
Incorrecto
|
0.019 s | 3 KBi |
#9 |
Incorrecto
|
0.028 s | 3 KBi |
#10 |
Incorrecto
|
0.014 s | 3 KBi |
#11 |
Incorrecto
|
0.011 s | 3 KBi |
#12 |
Incorrecto
|
0.027 s | 3 KBi |
#13 |
Incorrecto
|
0.026 s | 3 KBi |
#14 |
Incorrecto
|
0.011 s | 3 KBi |
#15 |
Incorrecto
|
0.018 s | 3 KBi |
#16 |
Incorrecto
|
0.018 s | 3 KBi |
#17 |
Incorrecto
|
0.02 s | 3 KBi |
#18 |
Incorrecto
|
0.008 s | 3 KBi |
#19 |
Incorrecto
|
0.019 s | 3 KBi |
edifs = list(map(int, input().split(' '))) area = 0 for i in range(len(edifs)-1): area = max(area, edifs[i]) for j in range(i+1, len(edifs)): newArea = min(edifs[i], edifs[j]) * (j - i) if newArea > area: area = newArea print(area)