<p>Given two arrays of integers with equal lengths, return the maximum value of:</p>

<p><code>|arr1[i] - arr1[j]| + |arr2[i] - arr2[j]| + |i - j|</code></p>

<p>where the maximum is taken over all <code>0 &lt;= i, j &lt; arr1.length</code>.</p>

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

<pre>
<strong>Input:</strong> arr1 = [1,2,3,4], arr2 = [-1,4,5,6]
<strong>Output:</strong> 13
</pre>

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

<pre>
<strong>Input:</strong> arr1 = [1,-2,-5,0,10], arr2 = [0,-2,-1,-7,-4]
<strong>Output:</strong> 20
</pre>

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

<ul>
	<li><code>2 &lt;= arr1.length == arr2.length &lt;= 40000</code></li>
	<li><code>-10^6 &lt;= arr1[i], arr2[i] &lt;= 10^6</code></li>
</ul>

class Solution:
    def maxAbsValExpr(self, arr1: List[int], arr2: List[int]) -> int:
        
        n = len(arr1)
        mv = [arr1[0] + arr2[0], arr1[0] - arr2[0], arr2[0] - arr1[0], -arr1[0]-arr2[0]]
        result = 0

        for i in range(1, n):
            c1, c2, c3, c4 = arr1[i] + arr2[i], arr1[i] - arr2[i], arr2[i] - arr1[i], - arr1[i] - arr2[i]
            result = max(c1 + i + mv[3], c2 + i + mv[2], c3 + i + mv[1], c4 + i + mv[0], result)
            mv[0] = max(mv[0], c1 - i)
            mv[1] = max(mv[1], c2 - i)
            mv[2] = max(mv[2], c3 - i)
            mv[3] = max(mv[3], c4 - i)
        
        return result

24300