1039. Minimum Score Triangulation of Polygon

Triangulate a convex polygon (vertices given in order as values) into n−2 triangles; each triangle costs the product of its three vertex values; minimise total cost. This is the archetypal interval…