βMaximum Absolute Difference
f(i, j) for all 1 β€ i, j β€ N.
f(i, j) is defined as |A[i] - A[j]| + |i - j|Brute Force Solution
int Solution::maxArr(vector<int> &A) {
int n = A.size();
int maximum = INT_MIN;
for(int i = 0; i < n; i++)
for(int j = i + 1; j < n; j++)
maximum = max(maximum, abs(A[i] - A[j]) + j - i);
return maximum;
}Optimal ?
Last updated