Given an array arr of n integers, in a single operation, one can reduce any element of the array by 1. Find the minimum number of operations required to make the array a bitonic array.
`Example of a bitonic array: [0,1,2,3,2,1,0,0].
Example 1: [3,3,3,3,3], Answer:6, Final Array: [1,2,3,2,1].
Example 2: [1,1,3,1,1], Answer:3, Final Array: [0,1,2,1,0].
Example 3: [1,2,1,3,2], Answer:5, Final Array: [1,2,1,0,0] OR [0,0,1,2,1].`
In the question, a bitonic array was defined as It can have any number of zeros in prefix and suffix. The non-zero part should increase from 1 to some integer k and then decrease to 1.
Can anyone help me out with the solution.
systummm is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.