DP on tree Problem

Правка en1, от C21, 2019-09-20 02:58:41

Problem: https://www.codechef.com/problems/HLD/

I was only able to come up with the simple O(n^2) DP. I went through the editorial but didn't fully understand it.

Can someone share their ideas/approaches.

Any help would be appreciated.

Теги #dynamic programming, dp on a tree, dp optimisation

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский C21 2019-09-22 12:04:24 14
en2 Английский C21 2019-09-20 03:00:13 0 (published)
en1 Английский C21 2019-09-20 02:58:41 264 Initial revision (saved to drafts)