Please help me solving this problem. I am not getting any idea how to proceed.↵
↵
You are given a tree with N nodes and each i'th node has the value a[i] (can be positive as well as negative)n 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 athe weight of an edge from negative value to positive and vice — versa.
↵
You are given a
