登录
首页 » Visual C++ » the-dynamic-planning

the-dynamic-planning

于 2011-12-15 发布 文件大小:59KB
0 277
下载积分: 1 下载次数: 3

代码说明:

  本文讨论了动态规划这一思想的核心内容和其基本特点,探讨了动态规划思想的适用范围,动态规划子问题空间和递推关系式确立的一般思路。(This paper discusses the dynamic planning this thought core content and its basic characteristics, this paper discusses the dynamic planning idea, the applicable scope of the dynamic programming problem space and son recursive formula of the establishment of general thoughts. )

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Cpp2
    c-w算法,讲述一种分配运输的节约方法,适合于车辆的调度(c-w algorithm,About one distribution transport saving method, suitable for vehicle scheduling)
    2011-12-07 15:02:14下载
    积分:1
  • Huffman
    程序可以实现哈弗曼自动编码功能!很详细的!很有参考价值!(Program can be Havermann automatic coding features! Very detailed! A good reference!)
    2010-07-21 22:06:48下载
    积分:1
  • tree
    C语言树的简单实现,介绍了树你前序遍历,树插入与删除节点的实现(C-tree is simple to achieve, before you introduced the tree traversal, tree insert and delete nodes to achieve)
    2011-01-11 22:19:07下载
    积分:1
  • cengcipianli
    按照一定的输入求出二叉树的层次遍历,输出相应的结果(Calculated in accordance with the input binary tree traversal of the hierarchy, the output of the corresponding results)
    2012-06-08 21:44:41下载
    积分:1
  • The-sum-of-Multinomial
    数据结构中的一元多项式相加,多于考研算法实现很重要。后续部分将在后期上传!(The sum of Multinomial)
    2011-05-09 15:47:30下载
    积分:1
  • cPP
    数据结构课设,城市地铁站的设计与使用规划(Set data structure class, subway station design and use of planning)
    2011-07-03 11:58:24下载
    积分:1
  • add-sub
    实现了多项式的创建,实现了多项式的加减乘除等基本操作(The realization of polynomial create, to achieve the polynomial add, subtract, multiply and divide the basic operation)
    2011-08-15 17:34:46下载
    积分:1
  • 2
    说明:  用链表的方式实现多项式的加减,其中结构体包含幂次和系数。(Polynomial addition and subtraction with a list of ways in which the structure and contains the power of coefficients.)
    2017-03-10 09:10:31下载
    积分:1
  • yuesehuhuan
    就是一个简单的约瑟夫环实现程序。主要就是在痛过程序实现栈的实现。(Joseph is a simple procedure to achieve ring. The main program is in pain over the realization of the realization of the stack.)
    2007-11-22 11:35:10下载
    积分:1
  • fml
    已知二叉树的先序遍历结果,建立二叉树并输出其先序、中序、后序遍历结果(Build a binary tree and print the results of preorder, midorder and postorder traversals based on the known result of preorder traversal)
    2015-02-15 15:20:26下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载