Make It Jagged

You are given an array $A$ of size $N$ consisting of distinct positive integers $A_1, A_2, \ldots, A_N$. The element $A_i$ is said to be a *local maximum* if it is strictly greater than both of its neighbours (that is $A_{i-1} < A_i$ and $A_{i+1} < A_i$). Similarly, $A_i$ is *local minimum* if it is strictly less than both of its neighbours ($A_{i-1} > A_i$ and $A_{i+1} > A_i$). Since $A_1$ and $A