登录
首页 » Visual C++ » DP

DP

于 2012-11-12 发布 文件大小:730KB
0 230
下载积分: 1 下载次数: 0

代码说明:

说明:  动态规划是用空间换时间的一种方法的抽象。(Dynamic programming is to use space in time a method of abstract.)

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

发表评论

0 个回复

  • Large_integer_multiplication
    算法分析与设计——大整数乘法。 计算两个超出机器数表示范围的整数的乘积。(Algorithm Analysis and Design- large integer multiplication. Calculating the number of two machines that go beyond the scope of the product of an integer.)
    2009-05-08 14:21:06下载
    积分:1
  • pinfanfangwen
    设有一头指针为L的带有表头结点的非循环双向链表,其每个结点中除有prev(前驱指针),data(数据)和next(后继指针)域外,还有一个访问频度域freq。在链表被起用前,其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时,令元素值为x的结点中freq域的值增1,并使此链表中结点保持按访问频度非增(递减)的顺序排列,同时最近访问的结点排在频度相同的结点的最后,以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法,该运算为函数过程,返回找到结点的地址,类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)
    2015-01-15 22:31:59下载
    积分:1
  • build_max_heap
    最大堆排序算法,C++语言编写,原程序,算法导论(The maximum heap sort algorithm, C++ language)
    2015-01-26 16:15:21下载
    积分:1
  • yuyundonghui
    参加运动会的 个学校编号为 。比赛分成 个男子项目和 个女子项目,项目编号分别为 和 。由于各项目参加人数差别较大,有些项目取前五名,得分顺序为7,5,3,2,1;还有些项目只取前三名,得分顺序为5,3,2。写一个统计程序产生各种成绩单和得分报表。 2、要求产生各学校的成绩单,内容包括各校所取得的每项成绩的项目号、名次(成绩)、姓名和得分;产生团体总分报表,内容包括校号、男子团体总分、女子团体总分和团体总分。 3、测试数据:对于 , , ,编号为奇数的项目取前五名,编号为偶数的项目取前三名,设计一组实例数据。 (The school serial number participating in Games is. Competition divides into men s event and women s event , the project serial number parts for the sum. The difference is bigger since every project participates in a number , some projects choose the first five , score order is 7 , 5 , 3 , 2 , 1 Still have some of projects taking the first three places , score only being 5 , 3 , 2 in proper order. Write a form for report counting procedure producing the various school report card and score. 2, demands the school report card producing every school , content includes every achievement project number , position in a name list (achievement) , full name and score per got by school Produce the group total points form for report , content including the school number , male person group total points , woman group total points and group total points. 3, testing data: Be that the odd number project chooses the first five to the serial number, the serial number is that the even number project c)
    2009-04-07 22:40:37下载
    积分:1
  • Huffman-Tree
    使用三叉链表实现的哈夫曼树,统计inputfile1.txt中各字符的出现频率,并据此构造Huffman树,编制Huffman 码;根据已经得到的编码,对01形式的编码段进行译码。 具体的要求: 1.将给定字符文件编码,生成编码,输出每个字符出现的次数和编码; 2.将给定编码文件译码,生成字符,输出编码及其对应字符。 (Emergence of the frequency of each character in the trigeminal lists using the Huffman tree, statistics inputfile1.txt, and accordingly the Huffman tree structure, preparation of Huffman code according to the coding has been. 01 to form the code segment for decoding. Specific requirements: 1 coding the given character file, generating the encoding, and outputting the number and encoding of each character 2 will be given the encoding file decoding, generating the character, the output code and its corresponding character.)
    2015-05-22 15:37:03下载
    积分:1
  • mathandos
    算法设计的动态规划,贪心算法 操作系统的银行家算法等五个小程序(data)
    2009-12-27 17:06:43下载
    积分: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
  • Cpp2
    c-w算法,讲述一种分配运输的节约方法,适合于车辆的调度(c-w algorithm,About one distribution transport saving method, suitable for vehicle scheduling)
    2011-12-07 15:02:14下载
    积分:1
  • chessboard-distance
    一道poj上的问题的解答,棋盘上的距离问题。即实现棋盘上从一个点移动到王,后,兵之间最短步数的解答。(A poj answers to your questions on the chessboard distance problem. That is, move from one point to the king on the board, after the shortest number of steps between the soldiers answer.)
    2012-06-20 10:10:45下载
    积分:1
  • Four-bracket-operator
    数据结构中,运用链表实现四则括号运算等,运行在VC控制台上。(Data structure, the use of chain operations to achieve four brackets, etc., running in the VC console.)
    2011-12-12 10:51:31下载
    积分:1
  • 696516资源总数
  • 106658会员总数
  • 16今日下载