title: Minimal elevator problem in a building with n floors and k lifts
body: <p>So the problem is:<br><br>
  <i>&quot;Given an <strong>n</strong> number of floors for a building with <strong>k</strong> lifts, where every lift L<sub>i</sub> goes from a<sub>i</sub> floor to b<sub>i</sub> floor, (a<sub>i</sub> and b<sub>i</sub> are given) find the minimum number of lifts from first to <strong>n</strong>-th floor.&quot;</i></p>
  <p>This problem has to be solved using dynamic programming. The only problem is I don't how to start.
  So does anyone have any type of ideas how to start this.</p>