Graph Cost

You have an array $A$ of size $N$, and a [complete](https://en.wikipedia.org/wiki/Complete_graph) [weighted](https://en.wiktionary.org/wiki/weighted_graph) graph with $N$ nodes and $\frac{N \cdot (N-1)}{2}$ undirected weighted edges connecting each pair of nodes. The weight of the edge between node $i$ and node $j$ is $|j - i| \cdot \max(A_i, A_j)$. The distance between $2$ nodes is defined as