Hello people, I’m trying to understand the final part of the solution once we have calculate the dp values. In particular, what’s the intuition behind moving left if dp[0][l + 1] is less than dp[1][j - 1].
the way I think about is that if we have identified the optimal blast starting between x[l] and x[j] we want to determine how to narrow the interval so that we minimize max(x[r] - x[l], 1 + max(dp[0][l], dp[1][r]). But I cannot go from here to the condition that actually passes the tests (choosing the smaller blast from the left or right).
Could someone enlighten me on what I’m missing?