Foreword
Dynamic programming knowledge is a very important point, large and small game there is always twelve DP title, illustrates the importance of dynamic programming.
Dynamic programming is mainly ideological, and there is no fixed template, then the problem is not how to determine dynamic planning?
DP title usually meet three conditions: sub-problems overlap , no aftereffect , the structural properties of the sub-optimal .
Dynamic programming problem as the original number of overlapping sub-problems, each sub-problem solving process is a stage,
Dynamic programming requirements of the current stage will not (ie sub-problem has been solved is not affect the subsequent sub-problem) is the follow-up phase of impact, this is no after-effect.
In general, dynamic programming in solving optimization problems, the optimal solution for each stage should be derived from the optimal solution in front of the stage, which is the optimal substructure property.
We know the dynamic programming problem is, how to solve it?
Dynamic programming to solve the problem, focusing on the state of the state transition equation :
As the name suggests, the state generally refers to a situation where certain object, to pay attention to the boundary;
It refers to the state of the state transition equation of the current phase transition to a state equation of the next stage.
State and state transition equation due to the problem vary, you want to define the status of skilled, draw the state transition equation, the most important way is to brush the question, DP title do more naturally know how to define.
Specific DP and the various types of topics are as follows.
table of Contents
This Konjac here summarizes some of the knowledge about dynamic programming, follow-up will be updated from time to time.