Max profit 1D wine problem (DP) created by vetional - https://repl.it/MQlJ/0

main.py

def maxprofit(price, year, memo):
  print price, year
  profit = 0
  if len(price) == 1:
    return price[0] * year
    
  key = '-'.join([str(p) for p in price]) + '--' +str(year)
  if key in memo:
    print 'memo hit: ' + key
    return memo[key]
  
  if len(price) == 0:
    return 0
  else:
    profit += max(price[0] * year + maxprofit(price[1:], year + 1, memo), \
              price[-1] * year + maxprofit(price[:-1], year + 1, memo))
  
  memo[key] = profit
  return profit
  
print maxprofit([2,3,5,1,4],1,{})