这是算法设计与分析课程实验，动态规划的源程序。包含最长上升子序列，最长公共子序列，最大字段和问题，DP背包问题-This is a test algorithm design and analysis programs, dynamic programming source code. Rising sequence containing the longest, longest common subsequence, maximum field and problems, DP knapsac

测试射线法C++实现（在有直射场情况下）-Test ray method C++ to achieve (in case there is direct field)

树的线索化，，由于那个最大字段和太大，没能传成，拿这个-Clues of the tree, due to the maximum field and is too large, could not pass into, take this to try! ! !