给定一个最大载重量为M的卡车和N种食品。已知第 i 种食品的最多拥有Wi 公斤，其商品价值为Vi元/公斤，编程确定一个装货方案，使得装入卡车中的所有物品总价值最大。
Greedy algorithm to solve the knapsack problem, given a maximum load of M trucks and N kinds of food. Known I kinds of food with a maximum of Wi kg, its commodity value of Vi yuan/kg, programming to determine a loading program, so that the total value of all items loaded into the truck. (2015-12-30, C++, 1KB, 下载1次)
后缀数组是处理字符串的有力工具。后缀数组是后缀树的一个非常精巧的替代
品，它比后缀树容易编程实现，能够实现后缀树的很多功能而时间复杂度也并不逊色，而且它
比后缀树所占用的内存空间小很多。可以说，后缀数组比后缀树要更为实用。自从拜读了罗穗
骞大牛的 WC2009 论文《后缀数组——处理字符串的有力工具》后，经过若干星期的努力（中
间有因某些原因而缓下来），终于把论文上面的练习题全部完成了，现在写写自己对后缀数组
的理解和感悟。在看本笔记时，请不要忘记了，这是笔记，而教材是《后缀数组——处理字符
串的有力工具》。
Suffix array is a powerful tool for dealing with strings. Suffix array is a very compact alternative to the suffix tree
Products, it is easy to programming than the suffix tree, can achieve many functions suffix tree and the time complexity is not inferior, and it
Much smaller than the suffix tree occupies memory space. It can be said to be more practical than the suffix array suffix tree. Ever since I read the Lo Sui
Qian large cattle WC2009 paper- after "suffix array processing strings powerful tool," After several weeks of effort (in
Thunderstorms slow down for some reason), and finally the paper above exercises completed, and now write own suffix array
Understanding and perception. Looking at the notes, do not forget, this is the notes, and textbooks are "suffix array- processing characters
Powerful tool "string. (2014-06-10, C++, 252KB, 下载4次)
“嘀、嘀、……”报警声接口，在电磁炉设计中的单片机模拟，由硬件和软件设计，汇编程序
" Tick, tick, ... ..." alarm sound interface, the microcontroller in the induction cooker design simulation, consists of hardware and software design, assembler (2010-03-26, C++, 29KB, 下载13次)
PDA系统工程的方案,包括简单的编程教程
PDA systems engineering programs, including a simple programming tutorial (2009-11-19, C++, 7960KB, 下载2次)