fork download
copy 
  1. def max_subset_sum(a1, a2):
  2.     n = len(a1)
  3.     if n == 0:
  4.         return 0
  5.  
  6.     dp = [0] * n
  7.     dp[0] = max(a1[0], a2[0], 0)
  8.  
  9.     if n == 1:
  10.         return dp[0]
  11.  
  12.     dp[1] = max(dp[0], a1[1], a2[1])
  13.  
  14.     for i in range(2, n):
  15.         dp[i] = max(dp[i - 1], max(a1[i], a2[i]) + dp[i - 2])
  16.  
  17.     return dp[n - 1]
  18.  
  19.  
  20. a1 = [1, 5, 3, 21234]
  21. a2 = [-4509, 200, 3, 40]
  22.  
  23. print(max_subset_sum(a1, a2))
Success #stdin #stdout 0.08s 14012KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
21434
https://ideone.com/heQ1sK
language:
Python 3 (python  3.12)
created:
2 hours 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!