#36527: python解(可以用min()來取代後面的條件式)
yygg0988199300@gmail.com
(你懂的)
學校
:
不指定學校
編號 : 225535
來源 : [61.228.222.156]
最後登入時間 ：
2025-06-09 14:23:14
n = int(input())
h = list(map(int, input().split()))
sum = 0
for i in range(n):
if i == 0 and h[i] == 0:
sum += h[1]
continue
elif i == n-1 and h[i] == 0:
sum += h[n-2]
continue
if i != 0 and i != n-1 and h[i]==0:
if h[i-1]>h[i+1]:
sum += h[i+1]
elif h[i-1]<h[i+1]:
sum += h[i-1]
else:
sum += h[i-1]