You are given an integer array heights of size n, where heights[i] represents the height of the ith block in an exercise routine.
You start on the ground (height 0) and must jump onto each block exactly once in any order.
a to a block of height b is (a - b)2.heights[i] is (0 - heights[i])2.Return the maximum total calories you can burn by selecting an optimal jumping sequence.
Note: Once you jump onto the first block, you cannot return to the ground.
Example 1:
Input: heights = [1,7,9]
Output: 181
Explanation:
The optimal sequence is [9, 1, 7].
heights[2] = 9: (0 - 9)2 = 81.heights[0] = 1: (9 - 1)2 = 64.heights[1] = 7: (1 - 7)2 = 36.Total calories burned = 81 + 64 + 36 = 181.
Example 2:
Input: heights = [5,2,4]
Output: 38
Explanation:
The optimal sequence is [5, 2, 4].
heights[0] = 5: (0 - 5)2 = 25.heights[1] = 2: (5 - 2)2 = 9.heights[2] = 4: (2 - 4)2 = 4.Total calories burned = 25 + 9 + 4 = 38.
Example 3:
Input: heights = [3,3]
Output: 9
Explanation:
The optimal sequence is [3, 3].
heights[0] = 3: (0 - 3)2 = 9.heights[1] = 3: (3 - 3)2 = 0.Total calories burned = 9 + 0 = 9.
Constraints:
1 <= n == heights.length <= 1051 <= heights[i] <= 105Loading editor...
[1,7,9]