title: Variant of rod cutting
body: <p>You are given a wooden stick of length X with m markings on it at arbitrary places (integral), and the markings suggest where the cuts are to be made accordingly. For chopping a L-length stick
  into two pieces, the carpenter charges L dollars (does not matter whether the two pieces are of equal length or not, i.e, the chopping cost is independent of where the chopping point is).
  Design a dynamic programming algorithm that calculates the minimum overall cost.</p>
  
  <p>Couldn't figure out the recurrence.
  Was asked this in a recent programming interview.</p>