What does dp algorithm mean?

Dp algorithm is a dynamic programming, a branch of operational research, and a process to solve the optimization of decision-making process.

Dynamic programming method is generally used to solve optimization problems. This kind of problem can have many feasible solutions, and each solution has a value. We hope to find the optimal solution. We call this solution the optimal solution of the problem, not the optimal solution, because there may be multiple solutions reaching the optimal value.

Introduction to dynamic planning process:

By determining the three elements of dynamic programming, the whole solution process can be described by an optimal decision table, which is a two-dimensional table with rows representing the decision-making stage and columns representing the problem state.

The data to be filled in the table generally corresponds to the optimal value of this problem at a certain stage and state (such as shortest path, longest common subsequence, maximum value, etc.). ). The process of filling in the table is to fill in the table according to the priority order of rows or columns, start with 1 row according to the recursive relationship, and finally get the optimal solution of the problem through simple selection or operation according to the data of the whole table.