Given a range, how can you find the minimum waste if you can't perform any resize operations?

Can we build our solution using dynamic programming using the current index and the number of resizing operations performed as the states?