Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

Problem : UVA 1205

Revision en1, by Mohtasim, 2018-07-04 10:04:34

I can't find an approach to merge the subtree's optimally. If anyone could solve this problem, could you share your idea on this ?

Thanks in advance :)

Tags dp, tree dp, uva 1205

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English Mohtasim 2018-07-04 10:04:34 174 Initial revision (published)