登录
首页 » Visual C++ » backtrackng

backtrackng

于 2017-01-01 发布 文件大小:2KB
0 306
下载积分: 1 下载次数: 1

代码说明:

  给定n种物品和一背包。物品i的重量是wi>0,价值为vi>0,背包的容量为c。选择装入背包的物品,使得装入背包中物品的总价值最大。(Given n kinds of goods and a backpack. Weight of the item i is wi> 0, the value of vi> 0, knapsack capacity c. Select the items into the backpack, so into the backpack of items in the total value of the maximum.)

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

发表评论

0 个回复

  • moni
    数据结构 银行模拟问题 (Bank of simulation data structure problem)
    2011-01-04 21:08:10下载
    积分:1
  • exp2-1
    数据结构(第四版)第二章上机实验题源程序答案详解(Data structure (fourth edition) chapter on lab answer questions Detailed source)
    2014-12-31 09:14:51下载
    积分:1
  • 11组表达式求值
    设计一个表达式求值的程序。该程序必须可以接受包含(,),+,-,*,/的中缀表达式,并求出结果。如果表达式正确,则输出表达式的结果;如果表达式非法,则不输出或输出其他字符。(Design an expression evaluation procedures. The program must accept (,), including +, -, *, / the infix expression, and the results obtained. If the expression is correct, the output of the expression is output; if the expression is illegal, no other characters are output or exported.)
    2017-06-14 15:06:29下载
    积分:1
  • xiererfenchazhao
    希尔排序c++数据结构算法 二分查找的递归算法(希尔排序c++数据结构算法 二分查找的递归算法 )
    2010-12-10 18:32:52下载
    积分:1
  • Data-structure
    数据结构的一些简单的排序算法,有利于初学者学习。(Data structure of some simple sorting algorithm is conducive to beginners learning.)
    2016-06-28 08:27:32下载
    积分:1
  • route-planning
    遗传算法实现飞机在三维空间的航迹规划 C代码(Genetic Algorithm Route Planning C code)
    2012-04-20 09:23:18下载
    积分:1
  • radixsort
    对首先产生20个随机数进行基数排序,是利用C++实现的(On the first 20 random numbers generated for the base sequencing is the use of C++ Realize the)
    2007-10-16 19:11:53下载
    积分:1
  • Six-degree-space
    中国大学MOOC-陈越、何钦铭-数据结构 解题报告—06-3 六度空间 (Chinese University MOOC- Chen Yue, He Qinming- data structure Solving report of the problem- 06-3 Six degrees space)
    2015-09-06 11:09:27下载
    积分:1
  • 2.2
    已知线性表中的元素以值递增有序排列,并以单链表作存储结构。试写一高效的算法,删除表中所有值大于mink且小于maxk的元素(若表中存在这样的元素)同时释放被删结点空间,并分析你的算法的时间复杂度(注意:mink和maxk是给定的两个参变量,它们的值可以和表中的元素相同,也可以不同)。(Known linear elements in the table to the value increments ordered, and a single list for the storage structure. Try to write a highly efficient algorithm to delete all values ​ ​ greater than mink and maxk elements smaller than (if there is such an element in the table) while the release of the deleted node space, and analyze your time complexity of the algorithm (Note: mink and maxk is given two parameters variables, their values ​ ​ and elements in the table can be the same or different).)
    2015-04-11 23:11:41下载
    积分:1
  • Huffman
    数据结构,利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)
    2014-01-28 18:25:24下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载