动态规划解决矩阵连乘问题 算法设计与分析实验题-With dynamic programming to solve the matrix multiplication problem

使用典型的动态规划的思想解石子问题，不过没有添加注释-The use of a typical dynamic programming solution of pebbles thinking problems, but did not add a comment

Visual studio 2005开发环境下 算法课程实验 用动态规划方法解决独立任务最优调度问题-Visual studio 2005 development environment,with a dynamic programming method,in algorithm course experiment, to solve the optimal scheduling independent tasks problem

关于两个字符串s1,s2的差别，可以通过计算他们的最小编辑距离来决定。用C++设计动态规划算法解决此类问题(The difference between the two strings s1, s2, can be determined by calculating their minimum edit distance.Using c + + design dynamic programming algorithm to solve these problems)