fork(5) download
copy 
  1. n=int(input())
  2. a=list(map(int,input().split(',')))
  3. dp=[[0,0,0] for _ in range(n+1)]
  4. for i in range(1,n+1):
  5.     dp[i][0]=max(dp[i][0],dp[i-1][-1]+a[i-1])
  6.     dp[i][1]=max(dp[i][1],dp[i-1][1]+a[i-1])
  7.     if i-2>=0:
  8.         dp[i][0]=max(dp[i][0],dp[i-2][-1]+a[i-1]*2)
  9.         dp[i][1]=max(dp[i][1],dp[i-2][1]+a[i-1]*2)
  10.     if i>=3:
  11.         dp[i][2]=max(dp[i][2],dp[i-3][1]+a[i-1]*3)
  12. print(max(dp[-1]))
Success #stdin #stdout 0.01s 27704KB
comments (?)
stdin
copy 
3
4,2,3
stdout
copy 
10
https://ideone.com/EQ5LPp
language:
Python 3 (python  3.9.5)
created:
4 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!