mak_0111's blog

By mak_0111, history, 8 years ago, In English

I have been trying to understand dp divide and conquer optimization but I am not able to solve spoj NKLEAVES (http://www.spoj.com/problems/NKLEAVES/). How to calculate cost function C[i][j] for a bunch of leaves in O(1) time using appropriate preprocessing?

Full text and comments »

  • Vote: I like it
  • +8
  • Vote: I do not like it