def kadomatsu(x): if (x[2]>x[1] and x[0]>x[1]) or (x[2]=0: dp[i+1]=dp[i-2]+a[i] else: dp[i+1]=a[i] dp[i+1]=max(dp[i+1],dp[i]) A=max(dp) dp=[0]*(n+1) for i in range(1,n-1): if ok[i]==1: if i-3>=0: dp[i+1]=dp[i-2]+a[i] else: dp[i+1]=a[i] dp[i+1]=max(dp[i+1],dp[i]) B=max(dp) dp=[0]*(n+1) for i in range(1,n-1): if ok[i]==1: if i-3>=0: dp[i+1]=dp[i-2]+a[i] else: dp[i+1]=a[i] dp[i+1]=max(dp[i+1],dp[i]) C=max(dp) print(max(A,B,C))