题解 | 小红的星尘收集

def main():
    a = list(map(int, input().strip().split()))
    dp = [0] * len(a)
    dp[0] = a[0]
    dp[1] = max(a[0], a[1])
    for i in range(2, len(a)):
        dp[i] = max(dp[i-2]+a[i], dp[i-1])
    print(dp[-1])

if __name__ == "__main__":
    main()

动态规划问题，dp[i]=max(dp[i-2]+a[i], dp[i-1])