Online Chat

0_1背包问题用动态规划解给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？ 在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-0_1 knapsack problem using dynamic programming solution of a given n types of goods and one backpack. Item i is the weight of wi, the value for vi, knapsack capacity c. Question should be how to choose the items into the backpack, the backpack into the total value of the largest items? In the selection of the items into the backpack, for each of the items i have only two choices, that is loaded or not loaded backpack backpack. Items should not be many times i load backpack can not only part of the goods loaded i. Therefore, the problem known as the 0-1 knapsack problem.

FoxMail信息自动填充-information automatically filled FoxMail

h.263+ vc++商业源代码，具体公司名称保密！-h.263 vc commercial source code, specific company names confidential!

采用C++编写的lzss压缩算法，尤其对于文本文件的压缩效果比较好-The use of C++ written lzss compression algorithms, especially for the compression effect of the text file is better

struts2 jar包 这是struts2的jar文件-This is struts2 jar package jar file of struts2

signal-processing.rar信号处理demo原码-signal processing signal-processing.rar the original demo code

用asp做的一个网站就业网站 用asp做的一个网站就业网站 -this is a jiuye station.this is a jiuye station.this is a jiuye station.this is a jiuye station.

huffman编码，一种压缩与解压缩的程序，仅供大家参考。-Huffman coding, a compression and decompression procedures are for your reference.

一种基于行程编码和小波变换的图像压缩编码算法，很值得参考-Itinerary based on wavelet transform coding and image compression coding algorithm, it is worth considering

介绍各种压缩的特点以及应用，欢迎大家位下载！-Introducing a wide range of compression characteristics of the application, Welcome to the digital download!