动态规划：最大子数组和

def solve():
    nums = [-____, ____, -____, ____, -____, ____, ____, -____, ____]
    max_sum = nums[____]
    cur_sum = nums[____]
    for num in nums[____:]:
        cur_sum = max(____)
        max_sum = max(____)
    print(____)