搜索资源列表
beibao
- 设有一个背包可以放入物品的重量为s,现有n件物品,重量分别为w[0],w[1],...,[n-1]。问题是能否从这n件物品中选择若干件放入此背包中使得放入的重量之和正好等于s。-Has a backpack can be placed in the weights of the articles of s, the existing n items, weight W [0], w [1], ..., [n-1]. The question is whether this certain wei
01backpack
- 用回溯法解决01背包问题,C++实现,通过读取data.txt文件得到背包容量和物品信息,下载文件后直接导入运行即可。-Backtracking to solve knapsack problem 01, C++ implementation, read the data.txt file the backpack capacity and items of information, to download the file directly import can be run.
suanfa
- 大家又到准备蓝桥比赛的时候了,这是我去年备赛时的几个java算法程序,其中包括汉诺塔、两种幻方、背包和约瑟夫环,汉诺塔是去年的考试题,希望可以帮到大家。-People to prepare the blue bridge game when I prepared race last year when several java algorithm, including the Tower of Hanoi, two magic squares, backpack and Josephus, To
beibao
- 背包问题,从m个物品中选出某几个,在背包的承重范围内使得背包的价值的最大-Knapsack problem, a few selected from the m items, making the value of the backpack in the backpack load-bearing within
Knapsack
- 描述: 需对容量为c 的背包进行装载。从n 个物品中选取装入背包的物品,每件物品i 的重量为wi ,价值为pi 。对于可行的背包装载,背包中物品的总重量不能超过背包的容量,最佳装载是指所装入的物品价值最高。 输入: 多个测例,每个测例的输入占三行。第一行两个整数:n(n<=10)和c,第二行n个整数分别是w1到wn,第三行n个整数分别是p1到pn。 n 和 c 都等于零标志输入结束。 输出: 每个测例的输出占一行,输出一个整
backpack
- 动态规划实现0-1背包问题和贪心法实现背包问题-Dynamic programming to realize knapsack problem and greedy method to realize knapsack problem
12-01bag
- 01背包问题 问题陈述:给定n种物品和一背包,物品i的重量是wi,其价值为vi,背包的容量为C。合理选择物品装入背包,使得装入背包中物品的总价值最大。在选择装入背包的物品时,对每种物品i只有两种选择,即装入背包或不装入背包。不能将物品i装入背包多次,也不能只装入部分的物品i。 问题分析:0 1背包问题是一个子集选取问题,适合于用子集树表示0 1背包问题的解空间。在搜索解空间树时,只要其左儿子结点是一个可行结点,搜索就进入左子树,在右子树中有可能包含最优解时才进入右子树搜索;否则将右子树
beibao
- 求解背包问题:一个背包可装总重量 T,现有 n 个物件,其重量分别为(W1、W2、…、Wn)。问能否从这 n 个物件中挑选若干个物件放入背包中,使其总重量正好为 T ?若有解则给出全部解,否则输出无解-Knapsack problem: a backpack can be fitted to the total weight of T n existing object, its weight (W1, W2, ..., Wn). Asked whether this n objects to
outside-traning-bagpack-problem
- 背囊优化问题主要用于解决如何使野外训练中背囊内物品价值最大化的研究。我们引入背包问题的基本模型,具体结合两种实际情况,分别应用贪婪算法以及粒子群算法,得出了满足约束条件的满意解。-Backpack optimization problem to solve how to maximize the value of items in the backpack field training. We introduce the basic model of the knapsack problem,
Rucsac
- The BackPack problem-The BackPack problem..
bpck
- This a low-level protocol driver for the MicroSolutions,"backpack" parallel port IDE adapter. -This is a low-level protocol driver for the MicroSolutions,"backpack" parallel port IDE adapter.
01-backpack
- ACM算法问题:0-1背包问题。此代码用vc++b编写。-ACM algorithm problem :0-1 of the knapsack problem. Write this code vc++b.
bag.zip
- 计算物品堆叠所占的背包格子数,通过取余取整获得。,The calculate the backpack plaid number of items stacked share, rounded to obtain by taking the remainder.
joj2526
- 背包问题C++实现,最基本的背包,此题为joj2526题目代码-Knapsack problem C++ to achieve the most basic backpack, entitled joj2526 topic code
hdu4508-
- 完全背包问题C++实现,最基本的背包,此题为hdu4508题目代码-The full knapsack problem C++ achieve the most basic backpack, entitled hdu4508 topic code
Minimum-backpack
- 假设有许多盒子,每个盒子能保存的总重量为1.0。有N个项i1,i2,…,iN,它们的重量分别是w1,w2,…,wN。 目的是用尽可能少的盒子放入所有的项,任何盒子的重量不能超过他的容量。-Suppose there are many box, each box can be saved on the total weight of 1.0. N items I1, I2, ..., IN, the weight of them are w1, w2, ..., Wn. The purpos
knapsack
- 蛮力法和动态规划法解决01背包问题。输入文件"backpack.in":第一行两个整数:物品个数N,背包容量.之后N行每行两个整数,分别为物品重量和物品价值-Dynamic programming method to solve the 01 backpacks problem. The input file backpack.in,: two integers: the first line items number N, backpack capacity after two integer
HookLib
- 以前学习写辅助时写的,这是一个dll。可以查看人物信息,背包物品列表,怪物列表,地上物品列表,以及组队、开店、自动打怪、走路等功能。-Before learning to write auxiliary write a dll. Can view character information, backpack items list, monster list, the ground items list, as well as team, shop, automatic Daguai funct
beibao
- 给定一个容量为C的背包及n个重量为 wi,价值为pi的物品,要求把物品装入背 包,使背包的价值最大,此类问题为背 包问题。物品或者装入背包,或者不装 入背包,称之为0/1背包问题。 -A given a capacity for the the C of the backpack, and n a of by weight for the wi, the value of for the the the items of of pi, requirements of the
ppc6lnx
- ppc6lnx.c is a par of the protocol driver for the Micro Solutions ,"BACKPACK" parallel port IDE adapter-ppc6lnx.c is a par of the protocol driver for the Micro Solutions ,"BACKPACK" parallel port IDE adapter