You are given an integer array heights of length n, where heights[i] represents the height of the object at index i.

You start on the ground at height $0$. You must visit every object in heights exactly once by jumping from one object to another in any order of your choice.

When jumping from a height $u$ to a height $v$, the calories burnt equal $(u - v)^2$.

Return the maximum total calories that can be burnt after visiting all objects.

Constraints:

• $1 \leq$ n $==$ heights.length $\leq 10^5$

• $1 \leq$ heights[i] $\leq 10^5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.