-
compression/decompression source category
压缩/解压缩类源码-compression/decompression source category
- 2022-02-04 21:49:58下载
- 积分：1
-
vc下的压缩和解压缩代码
vc下的压缩和解压缩代码-vc under the compression and decompression code
- 2022-01-26 00:53:59下载
- 积分：1
-
776的解压缩算法篇
776的解压缩算法篇--776`s decompression algorithm
- 2023-04-05 04:30:03下载
- 积分：1
-
static data member in use
静态数据成员的使用-static data member in use
- 2022-04-26 09:52:35下载
- 积分：1
-
javaME动画使用JavaME直接运行拷贝到C盘C:Documents and SettingsAdministratorj2mewtk2.5.2apps...
javaME动画使用JavaME直接运行拷贝到C盘C:Documents and SettingsAdministratorj2mewtk2.5.2apps-javaME animation using JavaME run directly copied to the C drive C: Documents and Settings Administrator j2mewtk 2.5.2 apps
- 2022-03-05 22:16:51下载
- 积分：1
-
音频
audio-video-codecs.rar语音编解码器-audio-video-codecs.rar speech codec
- 2023-06-21 10:40:05下载
- 积分：1
-
可运行，运用游程长度编码法进行压缩和解压缩图象文件。
可运行，运用游程长度编码法进行压缩和解压缩图象文件。-Can be run using run-length coding method for document image compression and decompression.
- 2022-01-26 05:12:35下载
- 积分：1
-
有关队列的排序问题
有关队列的排序问题-the Queue scheduling problem
- 2022-08-04 00:53:10下载
- 积分：1
-
database source code
database source code
- 2022-09-07 19:45:03下载
- 积分：1
-
0_1背包问题使用一个给定n种去的动态规划解法…
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.
- 2023-04-12 03:25:02下载
- 积分：1
