Divide and conquer optimization

Правка en1, от mak_0111, 2016-12-06 23:04:10

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?

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский mak_0111 2016-12-06 23:04:54 0 (published)
en1 Английский mak_0111 2016-12-06 23:04:10 291 Initial revision (saved to drafts)