fork download
copy 
  1. a = [75,  5, 10, 40, 50, 35,75]
  2. inc = 0
  3. exc = 0
  4. for i in a:
  5.     t = exc + i
  6.     exc = max(inc,exc)
  7.     inc = t
  8. print(max(inc,exc) - a[0])
  9.  
  10.  
Success #stdin #stdout 0.03s 9440KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
135
https://ideone.com/6ibRm9
Maximum sum such that no two elements are adjacent(if array is circular)
language:
Python 3 (python  3.9.5)
created:
9 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!