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.
- Number of substrings divisible by 8 but not by 3
- Shortest Uncommon Subsequence
- Minimum steps to delete a string after repeated deletion of palindrome substrings
- Longest alternating subsequence
- Temple Offerings
- Subset with sum divisible by m
- Sum of all substrings of a string representing a number | Set 1
- Count of strings that can be formed using a, b and c under given constraints
- Highway Billboard Problem
- Finding the maximum square sub-matrix with all equal elements
- Probability of getting at least K heads in N tosses of Coins
- Minimum Sum Path In 3-D Array
- Ways to write n as sum of two or more positive integers
- Assembly Line Scheduling | DP-34
- Optimal Strategy for a Game | DP-31