<p>You are given an integer array <code>nums</code>. The <strong>absolute sum</strong> of a subarray <code>[nums<sub>l</sub>, nums<sub>l+1</sub>, ..., nums<sub>r-1</sub>, nums<sub>r</sub>]</code> is <code>abs(nums<sub>l</sub> + nums<sub>l+1</sub> + ... + nums<sub>r-1</sub> + nums<sub>r</sub>)</code>.</p>

<p>Return <em>the <strong>maximum</strong> absolute sum of any <strong>(possibly empty)</strong> subarray of </em><code>nums</code>.</p>

<p>Note that <code>abs(x)</code> is defined as follows:</p>

<ul>
	<li>If <code>x</code> is a negative integer, then <code>abs(x) = -x</code>.</li>
	<li>If <code>x</code> is a non-negative integer, then <code>abs(x) = x</code>.</li>
</ul>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,-3,2,3,-4]
<strong>Output:</strong> 5
<strong>Explanation:</strong> The subarray [2,3] has absolute sum = abs(2+3) = abs(5) = 5.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [2,-5,1,-4,3,-2]
<strong>Output:</strong> 8
<strong>Explanation:</strong> The subarray [-5,1,-4] has absolute sum = abs(-5+1-4) = abs(-8) = 8.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>-10<sup>4</sup> &lt;= nums[i] &lt;= 10<sup>4</sup></code></li>
</ul>

class Solution:
    def maxAbsoluteSum(self, nums: List[int]) -> int:
        mmin , mmax = [0]*int(1e5+10), [0]*int(1e5+10)
        n = len(nums)
        mmin[n-1] ,mmax[n-1] = nums[-1],nums[-1]
        for i in range(n-2, -1, -1):
            if nums[i] <= 0:
                mmin[i] = nums[i] if mmin[i+1] > 0 else nums[i] + mmin[i+1]
                mmax[i] = nums[i] + mmax[i+1]
            else:
                mmax[i] = nums[i] if mmax[i+1] < 0 else nums[i] + mmax[i+1]
                mmin[i] = nums[i] + mmin[i+1]

        ans = -1
        for i in range(n):
            ans = max(ans, abs(mmin[i]))
            ans = max(ans, abs(mmax[i]))
        return ans
30400