登录
首页 » Visual C++ » zuiyouerfenjiansuozhu

zuiyouerfenjiansuozhu

于 2013-10-10 发布 文件大小:10KB
0 193
下载积分: 1 下载次数: 2

代码说明:

  最优二叉搜索树问题具有最优子结构性质,即其任意一棵子树都是一棵独立的最优二叉搜索树,所以可以采用动态规划方法,并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)

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

发表评论

0 个回复

  • lujing
    图的邻接表生成,深度遍历及任意两点间的路径(The adjacency table to generate deep traversal path between any two points)
    2012-05-22 18:18:29下载
    积分:1
  • 1_1
    最小生成树算法 克鲁斯法尔算法 球最佳路径(kulru method class maiun void cx )
    2009-09-13 22:45:01下载
    积分:1
  • mataqipan
    马踏棋盘的贪心算法,8*8棋盘,基本上不用回溯。(horse riding chessboard of the greedy algorithm, 8* 8 chessboard, basically not retroactive.)
    2006-05-30 20:05:17下载
    积分:1
  • datastructimplement
    包含了数据结构实现堆栈的方法。 主要有链表实现和数组实现以及堆栈的应用。(This pakcet inclues the programs to implement the stack with chain and array and it s application.)
    2009-04-01 18:45:57下载
    积分:1
  • zhebanchazhao
    这半查找法 是一种快速查找算法 查找效率比较高 容易实现 理想的查找算法(This search method is a fast and find more efficient algorithms to find easy to implement the ideal search algorithm)
    2012-05-04 00:03:29下载
    积分:1
  • permutations
    组合数学全排列,包含有六种全排列的方法,字典序法(math of permutations)
    2011-12-12 10:51:16下载
    积分:1
  • JGMFC
    一个MFC编的算法分析课程设计实验“重排九宫源码”(MFC compiled an algorithm analysis course design experiment " rearrangement kau kung source" )
    2010-03-11 16:13:32下载
    积分:1
  • StringClass
    这个代码是STRING类的声明及实现,因为我认为C++类库中的string类比较庞大,找一个函数需要很长时间,所以用一个简单明了的代替之.(STRING kind of statement and realized, because I think the C library string of relatively large, a function for a very long time. Therefore, the use of a simple and straightforward replaced it.)
    2006-05-17 17:46:58下载
    积分:1
  • migong
    输入迷宫行列数,1代表墙0代表路,之后系统生成路径(Enter the maze ranks number 1 represents 0 for Wall Road, after the system-generated path)
    2016-05-14 20:16:00下载
    积分:1
  • a
    说明:  进程死锁.资源分配图的绘制 建立所需数据结构;  使用题目21存成的资源分配图的文件作为输入;  编写资源分配图化简算法;  每化简一步,在屏幕上显示化简的当前结果;  最后给出结论,是否死锁,如思索给出死锁的进程及资源; (Process deadlock. Resource allocation mapping  establish the required data structures  Use title 21 deposit into resource allocation graph file as input  writing resource allocation map simplification algorithm  Each simplification step, on-screen display simplification of the current result  Finally, the conclusion of a deadlock, deadlock is given as thinking processes and resources )
    2013-07-04 19:50:58下载
    积分:1
  • 696518资源总数
  • 105873会员总数
  • 12今日下载