1131. 绝对值表达式的最大值
给你两个长度相等的整数数组,返回下面表达式的最大值:
∣ a r r 1 [ i ] − a r r 1 [ j ] ∣ + ∣ a r r 2 [ i ] − a r r 2 [ j ] ∣ + ∣ i − j ∣ |arr1[i] - arr1[j]| + |arr2[i] - arr2[j]| + |i - j| ∣arr1[i]−arr1[j]∣+∣arr2[i]−arr2[j]∣+∣i−j∣
其中下标 i,j 满足 0 <= i, j < arr1.length。
示例 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
通过次数2,456提交次数5,567
分析
遇到绝对值,就把绝对值符号去掉。
那么有三项,每一项可正可负,共有8种可能。
000
001
010
011
100
101
110
111
由于 i 和 j 可以互换,所以101 和 010
是重复的,那么八种我们只需要看四种,也就是前四种,分别是:(arr1用a代替,arr2用b代替)
a
[
i
]
+
b
[
i
]
+
i
−
(
a
[
j
]
+
b
[
j
]
+
j
)
—
—
①
a[i] + b[i] + i - (a[j] + b[j] + j) ——①
a[i]+b[i]+i−(a[j]+b[j]+j)——①
a
[
i
]
+
b
[
i
]
−
i
−
(
a
[
j
]
+
b
[
j
]
−
j
)
—
—
②
a[i] + b[i] - i - (a[j] + b[j] - j) ——②
a[i]+b[i]−i−(a[j]+b[j]−j)——②
a
[
i
]
−
b
[
i
]
+
i
−
(
a
[
j
]
−
b
[
j
]
+
j
)
—
—
③
a[i] - b[i] + i - (a[j] - b[j] + j)——③
a[i]−b[i]+i−(a[j]−b[j]+j)——③
a
[
i
]
−
b
[
i
]
−
i
−
(
a
[
j
]
−
b
[
j
]
−
j
)
—
—
④
a[i] - b[i] - i - (a[j] - b[j] - j)——④
a[i]−b[i]−i−(a[j]−b[j]−j)——④
那么我们只需要分别取①②③④式前半部分的最大值,和后半部分的最小值,然后再取相减之后的最大值即可。
class Solution {
public:
int maxAbsValExpr(vector<int>& a, vector<int>& b) {
int n = a.size();
int INF = 0x3f3f3f3f;
int amax = -INF , amin = INF , bmax = -INF , bmin = INF , cmax = -INF , cmin = INF , dmax = -INF , dmin = INF;
for(int i = 0; i < n; i++)
{
amax = max(amax , a[i] + b[i] + i);
amin = min(amin , a[i] + b[i] + i);
bmax = max(bmax , a[i] + b[i] - i);
bmin = min(bmin , a[i] + b[i] - i);
cmax = max(cmax , a[i] - b[i] + i);
cmin = min(cmin , a[i] - b[i] + i);
dmax = max(dmax , a[i] - b[i] - i);
dmin = min(dmin , a[i] - b[i] - i);
}
return max(max(amax - amin , bmax - bmin) , max(cmax - cmin , dmax - dmin));
}
};