Matrix Chain Multiplication — Solution & Editorial

Back to the Problem

Interval DP: dp[i][j] = cheapest way to multiply matrices i..j, splitting at every k. O(N³).

Complexity: O(N³)

Watch out: Costs reach ~10⁶·N ≈ 10⁹ — 64-bit.