【題目描述】
Given an array with integers.Find two non-overlapping subarrays A and B, which |SUM(A) - SUM(B)| is the largest.Return the largest difference.
Notice:The subarray should contain at least one number
給定一個(gè)整數(shù)數(shù)組酱吝，找出兩個(gè)不重疊的子數(shù)組A和B祥得，使兩個(gè)子數(shù)組和的差的絕對(duì)值|SUM(A) - SUM(B)|最大谬泌。返回這個(gè)最大的差值。
注意:子數(shù)組最少包含一個(gè)數(shù)
【題目鏈接】
http://www.lintcode.com/en/problem/maximum-subarray-difference/
【題目解析】
這道題的解法是max subarray肆捕，min subarray，max subarray II的結(jié)合盖高，不細(xì)說(shuō)了慎陵，注意左邊要維護(hù)兩個(gè)數(shù)組分別是globalMax和globalMin，右邊時(shí)候同理的喻奥，localMax和localMin席纽，DP方程參考之前的題目，時(shí)間復(fù)雜度O(n)撞蚕，空間復(fù)雜度O(n)
【參考答案】
http://www.jiuzhang.com/solutions/maximum-subarray-difference/
