Skip to content

Introduction to Dynamic Programming

This chapter will introduce dynamic programming (DP), the problems it solves, the algorithms designed based on it, and their optimizations.

Dynamic programming is a method for solving complex problems by breaking them down into relatively simpler subproblems.

Since dynamic programming is not a specific algorithm but rather an approach to solving particular problems, it appears in various data structures, and the types of problems related to it are more diverse.

In OI, recursive solutions for non-optimization problems such as counting are often informally referred to as DP. Therefore, this chapter will list them together. In fact, dynamic programming does share many similarities with other types of recursion, and it is helpful to note their differences and commonalities while learning.

References

Dynamic Programming - Wikipedia, the free encyclopedia

本页面最近更新：，更新历史
发现错误？想一起完善？ 在 GitHub 上编辑此页！
本页面贡献者：OI-wiki
本页面的全部内容在 CC BY-SA 4.0 和 SATA 协议之条款下提供，附加条款亦可能应用