对1D/1D类的动态规划 给出一些可以把复杂度优化到O(nlogn)和O(n)的方法-it provides some methods to solve some dynamic programming problem with complexity O(nlogn) or O(n)

POJ专题分类,按算法分类，包含基本算法、图算法、数据结构、简单搜索、动态规划、数学、数论、计算几何等-POJ thematic classification algorithm segments, including basic algorithms, graph algorithms, data structures, a simple search, dynamic programming, mathematics, number theory, computational geometr

文章运用m atlab语言给出了二维动态规划逆序算法的程序, 并且通过两个数值实例验证了该程序的有效性, 同时也表明了该程序对动态规划问题具有一定的通用性。-By applying m atlab language gives the two-dimensional dynamic programming algorithm reverse the procedure, and by two numerical examples demonstrate the effectiveness of

动态规划程序是求解决策过程(decision process)最优化的数学方法。-dynamic programming