Given an array, we need to modify values of this array in such a way that sum of absolute differences between two consecutive elements is maximized. If the value of an array element is X, then we can change it to either 1 or X.
Input : arr = [3, 2, 1, 4, 5] Output : 8 We can modify above array as, Modified arr = [3, 1, 1, 4, 1] Sum of differences = |1-3| + |1-1| + |4-1| + |1-4| = 8 Which is the maximum obtainable value among all choices of modification. Input : arr = [1, 8, 9] Output : 14
This problem is a variation of Assembly Line Scheduling and can be solved using dynamic programming. We need to maximize sum of differences each value X should be changed to either 1 or X. To achieve above stated condition we take a dp array of array length size with 2 columns, where dp[i] stores the maximum value of sum using first i elements only if ith array value is modified to 1 and dp[i] stores the maximum value of sum using first i elements if ith array value is kept as a[i] itself.Main thing to observe is,
Time Complexity : O(N)
Auxiliary Space : O(N)
This article is contributed by Utkarsh Trivedi. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Clustering/Partitioning an array such that sum of square differences is minimum
- Remove an element to maximize the GCD of the given array
- Remove array end element to maximize the sum of product
- Maximize array elements upto given number
- Maximize the sum of selected numbers from an array to make it empty
- Maximum sum in circular array such that no two elements are adjacent
- Number of ways to form an array with distinct adjacent elements
- Maximum sum in an array such that every element has exactly one adjacent element to it
- Maximize arr[j] - arr[i] + arr[l] - arr[k], such that i < j < k < l
- Burst Balloon to maximize coins
- Maximize the happiness of the groups on the Trip
- Maximize the binary matrix by filpping submatrix once
- Maximum sum such that no two elements are adjacent | Set 2
- Maximum sum such that no two elements are adjacent
- Maximum sum in a 2 x n grid such that no two elements are adjacent