Envío 5448

Código

N = input()
edifs = list(map(int, input().split(' ')))
area = 0
iReverse = len(edifs) - 1
jReverse = iReverse

for i in range(len(edifs)):
    j = i
    iReverse -= i
    area = max(area, edifs[i])

    while j < len(edifs) and edifs[j] >= edifs[i]:
        area = max(area, edifs[i] * (j - i + 1))
        j += 1

    jReverse = iReverse
    while jReverse >= 0 and edifs[jReverse] >= edifs[iReverse]:
        area = max(area, edifs[iReverse] * (iReverse - jReverse + 1))
        jReverse -= 1

area = min(edifs) * len(edifs)

print(area)