rachitiitr's blog

A Tricky DP Problem on Trees
By rachitiitr, history, 8 years ago, In English

http://rachitiitr.blogspot.in/2017/05/a-tricky-dp-problem-on-trees.html

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

»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Here is another problem which can be solved using a similar merge technique. My solution.

→ Reply
»
8 years ago, # |
  Vote: I like it +8 Vote: I do not like it

Btw, your implementation for the original problem is not completely correct. While you need to travel the whole map of each node your solution become O(n^2logn)

→ Reply