通过蛮力法，动态规划，分治法，三种方法实现求子段最大和。-Praying for Children segment and by the brute force method, dynamic programming, divide-and-conquer method, three methods.