#!/usr/local/bin/python3
# Author: Dr. Robert Heckendorn, Computer Science Department, University of Idaho, 2013
from lib import *

# for coins in positions 0..len(coins)-1
def coinrow(coins) :
    print(coins)
    f = array(len(coins), None)
    f[0] = coins[0]
    for i in range(1, len(coins)) :
        if i>1 : fm2 = f[i-2]
        else : fm2 = 0

        # separate the max functionality out and incorporate f[1]
        if coins[i]+fm2 > f[i-1] :
            f[i] = coins[i]+fm2
        else :
            f[i] = f[i-1]
    print(list(range(0, len(f))))
    print(f)
    return f[len(f)-1]

print(coinrow([5, 1, 2, 10, 6, 1, 9, 1]))

print(coinrow([5, 1, 2, 10, 6, 1, 1, 9]))