Find Diameter

You are given an array $A$ consisting of $N$ positive integers. We have a **weighted undirected** [complete graph](https://en.wikipedia.org/wiki/Complete_graph) $G$ with $N$ vertices numbered $1$ to $N$. The edge between vertices $(i,j)$ has a weight of $\min(|i-j|,|A_i-A_j|)$ for all $(1\le i \lt j \le N)$. We define the diameter of $G$ as $\max\limits_{1 \le u < v \le n}{\operatorname{d}(u,