全国计算机等级考试三级的部分上级题算法，对上机考试还不是很熟的人，很有帮助（并非书上的答案，是本人自己想的算法）...

提醒的例子，大家可以去看看 -Remind example, we can go and see

SVG动态读取数据库并实时显示出来。该代码以通过后台读取时间实时显示出来，如果你需要读取数据库，请在Default.aspx中处理即可。-SVG Dynamic read the database and displayed in real time. The code to read through the background of real-time display of time, if you need to read the database, please Default.aspx in treatment can be.

用c语言设计实现一个用事件驱动的“救护车调度”离散模型，模拟120急救中心响应每个病人的呼救信号统一调度救护车运行的情况。 我们对问题作适当简化，假设：某城市共有m个可能的呼救点(居民小区、工厂、学校、公司、机关、单位等)，分布着n所医院(包含在m个点中)，有k辆救护车分派在各医院待命，出现呼救病人时，由急救中心统一指派救护车接送至最近的医院救治。救护车完成一次接送任务后即消毒，并回原处继续待命。假定呼救者与急救中心、急救中心与救护车之间的通讯畅通无阻，也不考虑道路交通堵塞的影响。可以用m个顶点的无向网来表示该城市的各地点和道路。时间可以分钟为单位，路段长可表示为救护车行驶化费的分钟数。 这里设m=10,n=3,k=2。并且令消毒时间为２分钟-language used to achieve a design using event-driven "ambulance dispatch" dispersion model to simulate 120 emergency response center each patient"s distress signal unified dispatching ambulances running. We issue the appropriate simplified assumptions : m in a certain city a total of 000 points possible hue (residential quarters, factories, schools, companies, organizations, units, etc.), distributed by the hospital n (m included in the points), k ambulances were deployed in the various hospitals on standby there cries of the patients, from the first-aid center unified ambulance escort assigned to the nearest hospital for treatment. Ambulance completed

匈牙利算法 解决类似于线性规划中的分配问题,用于各种匹配算法-Hungary is similar to linear programming algorithm to solve the distribution problem, for a variety of matching algorithm

快速傅立叶变换，实现固定长度的快速傅立叶变换-Fast Fourier Transform, the realization of a fixed length of Fast Fourier Transform

数据结构教程代码 严蔚敏 上机实验操作代码-Data Structure Course Code YAN Wei-min experimental operation on machine code

数据结构课程的电子教案，很好，很精彩，为初学者的好帮手。-Electronic data structure course lesson plans, very good, very exciting, a good helper for beginners.

给售房作的,但还没有全完成,最好是只看看里面有用的东东就可以了-售房to make, but has not yet completed the whole, it is best just to see if there can be a useful Dongdong the

VB房地产售楼管理系统(Access),比较实用-VB real estate sales management system (Access), more practical

求乘积最大的子序列乘积,采用动态规划方法求解-product for the greatest sequences product using dynamic programming method for