LeetCode 1131. 绝对值表达式的最大值（数学 绝对值展开）

|arr1[i] - arr1[j]| + |arr2[i] - arr2[j]| + |i - j|

示例 1：
输入：arr1 = [1,2,3,4], arr2 = [-1,4,5,6]
输出：13

示例 2：
输入：arr1 = [1,-2,-5,0,10], arr2 = [0,-2,-1,-7,-4]
输出：20
 
提示：
2 <= arr1.length == arr2.length <= 40000
-10^6 <= arr1[i], arr2[i] <= 10^6

class Solution {
public:
    int maxAbsValExpr(vector<int>& arr1, vector<int>& arr2) {
    	int min1 = INT_MAX, min2 = INT_MAX, min3 = INT_MAX, min4 = INT_MAX;
    	int max1 = INT_MIN, max2 = INT_MIN, max3 = INT_MIN, max4 = INT_MIN;
    	for(int i = 0; i < arr1.size(); ++i)
    	{
    		max1 = max(max1, arr1[i] + arr2[i] + i);
    		max2 = max(max2,-arr1[i] + arr2[i] + i);
    		max3 = max(max3, arr1[i] - arr2[i] + i);
    		max4 = max(max4, arr1[i] + arr2[i] - i);
    		min1 = min(min1, arr1[i] + arr2[i] + i);
    		min2 = min(min2,-arr1[i] + arr2[i] + i);
    		min3 = min(min3, arr1[i] - arr2[i] + i);
    		min4 = min(min4, arr1[i] + arr2[i] - i);
    	}
    	return max(max(max1-min1, max2-min2),max(max3-min3, max4-min4));
    }
};