Velveeta Rotetel Pasta Commercial

Features Programming Problem Dynamic Dynamic programming



For a < matriz_cambio[i][j - monedas[i-1]] + 1){
problem can be solved with the technique

dynamic programming must


certain characteristics:





sequential nature of decisions: The
problem can be divided into stages.

Each stage has a number of states associated with it.

The optimal decision of each stage depends only on the current state and not the previous

decisions.

The decision taken at a stage which will be the state determines the next step.

In summary, the optimal policy from a state s of stage k to the final stage

is constituted by a decision that transforms a state s at stage s0 k +1 and the optimal policy

from state s0 to the final stage.