Max absolute path sum in a tree with atmost k inversions.

Правка en2, от --n--, 2021-05-04 21:17:38

Please help me solving this problem. I am not getting any idea how to proceed.

You are given an undirected weighed tree with N node . You need to find maximum absolute path sum in the tree with atmost k inversions. In one inversion you can change the weight of an edge from negative to positive and vice versa.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский --n-- 2021-05-04 21:17:38 126
en1 Английский --n-- 2021-05-04 21:08:21 416 Initial revision (published)