Envío 6691
Caso # |
Resultado |
Tiempo |
Memoria |
#1 |

Incorrecto
|
0.015 s
|
3 KBi |
#2 |

Incorrecto
|
0.015 s
|
3 KBi |
#3 |

Correcto
|
0.015 s
|
3 KBi |
#4 |

Correcto
|
0.014 s
|
3 KBi |
#5 |

Correcto
|
0.012 s
|
3 KBi |
#6 |

Correcto
|
0.016 s
|
3 KBi |
#7 |

Correcto
|
0.013 s
|
3 KBi |
#8 |

Incorrecto
|
0.017 s
|
3 KBi |
#9 |

Incorrecto
|
0.015 s
|
3 KBi |
#10 |

Correcto
|
0.015 s
|
3 KBi |
#11 |

Incorrecto
|
0.016 s
|
3 KBi |
#12 |

Incorrecto
|
0.014 s
|
3 KBi |
#13 |

Incorrecto
|
0.015 s
|
3 KBi |
#14 |

Correcto
|
0.017 s
|
3 KBi |
#15 |

Incorrecto
|
0.023 s
|
3 KBi |
#16 |

Incorrecto
|
0.016 s
|
3 KBi |
#17 |

Incorrecto
|
0.015 s
|
3 KBi |
#18 |

Incorrecto
|
0.015 s
|
3 KBi |
#19 |

Incorrecto
|
0.016 s
|
3 KBi |
Puntos totales: 37 / 100
Código
n_edificios = int(input())
alturas = list(map(int,list(input().split())))
arr=[]
k = 1
for x in range(n_edificios):
base = 1
altura_def= alturas[x]
for i in range(len(alturas)-k):
if(alturas[x]<=alturas[i+k] or alturas[x]>alturas[i+k]):
base +=1
else:
break
arr.append(int(base)*int(altura_def))
k=k+1
print(int(max(arr)))