Hi community, recently I found this contest and i am curious to know how to solve problem BOXING BOOKS.My first tought was a dp solution

dp[i][j] = min(dp[i][j], dp[r][j — 1] + cost(i,j))

Obviusly, this solution will give TLE, My question is Can this problem be solve using Divide and Conquer? There is a simplest solution?

Thanks.