Dynamic Programming Stuff

DP for Max payout Job Schedule

import numpy as np


def maxPayout(payouts, cooldown):
    n = len(payouts)
    payouts = payouts
    cooldown = cooldown
    opt = np.zeros([n, n])
    print(opt)
    for t in range(n):
        for j in range(n):
            if j == n - 1 - t:
                opt[j][t] = payouts[n - 1 - j]
            elif j > n - 1 - t:
                opt[j][t] = max(opt[j - 1][t], payouts[n - 1 - j] + opt[j -1- cooldown[n - 1 - j]][t])    
    print(opt)


payouts = [2, 1, 4, 9, 6]
cooldown = [1, 0, 1, 2, 3]
maxPayout(payouts, cooldown)