用三种方法解决最大子序列和问题，分别是基本方法，分治算法和动态规划算法，算法复杂度不断提高-Three methods were used to solve sequence and the biggest problem, respectively is the basic method and divide and conquer algorithm and dynamic programming algorithm, the complexity of the algorithm is i