Minimum Score Triangulation of Polygon
Medium
Interval DP
A convex polygon has vertices with the given values in order. Triangulate it into triangles; the score of a triangle is the product of its three vertex values. Print the minimum total score over all triangulations.
Constraints
3 <= n <= 50 1 <= value <= 100
Discussion
No discussions yet.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.