Minimum score polygon triangulation

You are given the vertex values of a convex polygon in clockwise order in an array values. Triangulate the polygon into n-2 triangles; the score of a triangle is the product of its three vertex values, and the score of a triangulation is the sum of its triangle scores. Return the minimum possible total score over all triangulations. The polygon has between 3 and 50 vertices, each value in [1, 100].