<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 {
public:
    int maxAbsValExpr(vector<int>& arr1, vector<int>& arr2) {
        int n = arr1.size();
        int max1 = INT_MIN, min1 = INT_MAX;
        int max2 = INT_MIN, min2 = INT_MAX;
        int max3 = INT_MIN, min3 = INT_MAX;
        int max4 = INT_MIN, min4 = INT_MAX;
        
        for (int i = 0; i < n; ++i) {
            int val1 = arr1[i] + arr2[i] + i;
            int val2 = arr1[i] - arr2[i] + i;
            int val3 = -arr1[i] + arr2[i] + i;
            int val4 = -arr1[i] - arr2[i] + i;
            
            max1 = max(max1, val1);
            min1 = min(min1, val1);
            
            max2 = max(max2, val2);
            min2 = min(min2, val2);
            
            max3 = max(max3, val3);
            min3 = min(min3, val3);
            
            max4 = max(max4, val4);
            min4 = min(min4, val4);
        }
        
        return max({max1 - min1, max2 - min2, max3 - min3, max4 - min4});
    }
};

27200