fork(1) download
copy 
  1. a = [1,3]
  2. n = 2
  3. for i  in range(n):
  4.     a = a + a
  5. inc = 0
  6. exc = 0
  7. for i in a:
  8.     t = exc + i
  9.     exc = max(inc,exc)
  10.     inc = t
  11. print((max(inc,exc))//4)
  12.  
Success #stdin #stdout 0.04s 9440KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
3
https://ideone.com/ejsNKB
Maximum sum such that no two elements are adjacent(for circular array modified)
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!