分治算法：求最大值

def solve():
    def max_dc(lst, left, right):
        if left == right:
            return lst[left]
        mid = (left + right) // 2
        left_max = max_dc(lst, left, mid)
        right_max = max_dc(lst, mid + 1, right)
        return max(left_max, right_max)
    lst = [3, 7, 1, 9, 2, 6, 4, 8, 5]
    print(max_dc(lst, 0, len(lst) - 1))