Rype
❔ Dynamical Programming to find min cost of supplying cars for 'n' months.
I constantly keep getting back to the beginning, deciding to use memoization, recurrence? i hate having to use a specific thing. I tried a lot of things but in the end with change of parameters answers were wrong. I think i will give up, thank you both for the help.
22 replies
❔ Dynamical Programming to find min cost of supplying cars for 'n' months.
I doubt bruteforce is what i should do though because with one decision of not storing/storing a car entire thing changes so the previous values are useless that is the entire point of dynamic programming.
22 replies
❔ Dynamical Programming to find min cost of supplying cars for 'n' months.
i mean i kinda get the knapsack problem using DP but the array indexes are weight and item but in my case demand varies so i'm confused as to what the indexes should represent. month and demand? and how does storage fit into the recursion?
22 replies