采用zlib标准的压缩源码，应用在Windows和Linux多平台下，分别有Linux下和Windows下VC的使用实例。...

作业，哈夫曼压缩解压缩-Operations, Huffman compression decompression

一个简单的基于MFC对话框的动态曲线程序源码 -A simple MFC dialog based on the dynamic curve of the procedure source

一个在MFC环境中使用的 InfoZip打包类，使用时需包含UNZDLL.DLL和ZIPDLL.DLL两个动态链接库-an environment in the use of the SDK package type, use and the need to contain UNZDLL.DLL ZIPDLL.DLL two dynamic link library

新的工具条显示地图放大，缩小，图层控制等等功能-New toolbar displayed map to enlarge, narrow, layer control function, etc.

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

经典的霍夫曼算法，此例为算法测试过程实现！并去除bug-Classic Huffman algorithm, in this case, the testing process for the algorithm to achieve! And remove the bug

这是一个基于字典的压缩和解压缩算法，其中包含压缩和解压缩的源码，是用VC实现的。其中还有测试的结果和过程-This is a dictionary-based compression algorithm, which contains the compression and decompression of the source, is to use the VC. Among them were the results of the tests and processes

关于C#语言开发的编程，打开需要C#软件。-About C# programming language development, open the need for C# software.

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.

自然笔 自然笔 自然笔 自然笔 -natural T T T Natural Natural Natural T T T Natural Natural Natural T T T Natural Natural Natural T T T Natural Natural Natural T T T natural natural T