Algorithm one (dynamic programming)

Operational research: Choose the best solution from a wide range of scenarios according to the given conditions and objectives! Dynamic programming is one of the important branches of operations research and a method to solve the optimization of multi-stage decision-making process.

The dynamic programming is simply: using the strategy of divide and conquer, the problem of solving the optimal solution is decomposed into the optimal solution of some sub-problems, and the sub-problem is decomposed into the combination of sub-problems recursively, and the optimal solution of the original problem and the local sub-problem can be solved by recursive recursive method. There may be overlapping between these local sub Is that a sub-problem may need to be solved multiple times, so the sub-problem and its solution need to be recorded, so that each sub-problem only one time, thus improving efficiency.

Optimization of original problem and only if sub-problem is optimal

The dynamic programming with the LIS problem, it feels really amazing to find a particular algorithm for some data structure,

Algorithm one (dynamic programming)