连续和问题的啦 还不错的 没看过的一起来看

算法设计的动态规划中的最优二叉搜索树问题，是用VC＋＋编写的-algorithm design of dynamic optimal planning of two forks search tree problem by using VC++ prepared

VC环境下实现动态添加删除用户，数据库为SQL Sever 2-VC environment dynamically add the user to delete the database for the SQL Sever 2000

给定n 个整数a ,a , ,an 1 2  组成的序列， a n i | |£ ，1 £ i £ n。如果对于i £ j ，有 0 = å = j k i k a ，则称序列区间i i j a , a , , a +1  为一个零和区间，相应的区间长度为j-i+1。-given n integers a, a, and an 1 2

library for parsing xml text and returning information of different type

duiwenjiandechuli fangbianguanli.

关于图的一些基本操作，以及实现细节-map on the basic operation and the achievement of details

二叉树系数计算[DeV-C++学习]，利用动态规划动态编程计算

此程序还不能对字符串排序，望能予以改进-A general soring program.*It can t sort string, and need to be improved.

程序功能： 实现一元多项式的四则运算 ，用到的主要就是多现式的实现，除法实现起来是很复杂的。-procedures functions : achieving a polynomial of four operations is mainly used in the more- is the realization Apart from achieving up is very complex.

POJ1840求一个有5位未知数方程解的个数,hash表的经典应用-POJ1840 seeking a five unknown number of equations, hash table classic application