| 基于动态规划算法的最值问题分析 |
| |
| 引用本文： | 陈捷. 基于动态规划算法的最值问题分析[J]. 电脑与信息技术, 2013, 0(6): 23-25 |
| |
| 作者姓名： | 陈捷 |
| |
| 作者单位： | 泰州学院数理信息学院江苏泰州225300 |
| |
| 摘 要： | 动态规划法是一种重要的求最优解的计算机程序设计算法，在各类软件设计大赛等各类程序设计大赛中广泛运用。文章通过设计合适的状态转移方程，分别使用两种算法对最值问题进行求解，并通过对求解过程及求解时间效率的对比实验验证了动态规划方法的高效性。
|
| 关 键 词： | 动态规划算法 最值问题 算法效率 |
The Value of Dynamic Programming Algorithm Based on the Analysis of the Problem |
| |
| CHEN Jie. The Value of Dynamic Programming Algorithm Based on the Analysis of the Problem[J]. Computer and Information Technology, 2013, 0(6): 23-25 |
| |
| Authors: | CHEN Jie |
| |
| Affiliation: | CHEN Jie (Taizhou University Mathematical Information Institute, Taizhou 225300,China) |
| |
| Abstract: | Dynamic programming is an important computer programmingalgorithm for the optimal solution, widely used in all kinds of software design contest and other kinds of program design contest In this paper, through the design of appropriate state transfer equation, we use two kinds of algorithms for solving the most value problem, and efficient dynamic programming method is verified through comparative experiments on the solving process and the solving time efficiency. |
| |
| Keywords: | dynamic programming algorithm extreme value problems efficiency of algorithm |
| 本文献已被 维普 等数据库收录！ |
