这是个usos的源码，呵呵，上传上来供大家学习之用。

请认真书写上传资料的详细功能、包含内容说明(至少要20个字)。尽量不要让站长把时间都花费在为您修正说明上。压缩包解压时不能有密码。

atM169的驱动程序，一定可以通过的，-atM169 driver will surely be passed

压缩文件的处理，可以嵌入自己的软件中-compressed files, embedded in its own software

一个不错的视频压缩源码-a good source of video compression

zlib pascal语言源码 -The source in Pascal of zlib

图像处理高通和低通滤波器及重建-matlab code

ZIP文件上传后自动解压程序源代码 -ZIP file uploads automatically extracting source code

这个是电子地图的 原程序 很好的,不错啊 侃侃 ,很有帮助-This is the electronic map of the original program very good, good ah Kankan, helpful

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.

劲舞009.让别人掉线.SF可用!大家来下载吧-Dance 009. Let others dropped. SF available! Everyone to download it