PAT B组 1119 胖达与盆盆奶 python AC

模拟，动态规划，前后分别dp一遍

n = int(input())
ll = list(map(int, input().split()))
dp = [200 for _ in range(n)]
for i in range(1, n):
    if ll[i] > ll[i - 1]:
        dp[i] = max(dp[i], dp[i - 1] + 100)
    elif ll[i] == ll[i - 1]:
        dp[i] = max(dp[i], dp[i - 1])
for j in range(-2, -n - 1, -1):
    if ll[j] > ll[j + 1]:
        dp[j] = max(dp[j], dp[j + 1] + 100)
    elif ll[j] == ll[j + 1]:
        dp[j] = max(dp[j], dp[j + 1])
print(sum(dp))