连续子数组最大和

# coding:utf-8def getResult(num, array):        if not num or not array:        return  None    s_um = array[0]    max_sum = array[0]    for i in range (1 , num):        # 判断贡献情况        if s_um > 0:            s_um += array[i]        else:            s_um = array[i]        if s_um > max_sum:            max_sum = s_um    return max_sumif __name__ == '__main__':    num = input ()    array = [int (i) for i in raw_input ().split (' ')]    res = getResult(num, array)    print res