Profitable paths -2

[knock_12]

Can some please provide the editorial for profitable paths2 from this month’s lunchtime

Link to the problem —> CodeChef: Practical coding for everyone

[therealnishuz]

PRT2 - Editorial

PROBLEM LINK: Contest Setter: Ahmad Tester: Yash Chandnani Editorialist: Rajarshi Basu DIFFICULTY: Easy-Medium PREREQUISITES: TreeDP PROBLEM: You are given a tree with N vertices (numbered 1 through N) and a sequence of integers A_1, A_2, \ldots, A_N. You may choose an arbitrary permutation p_1, p_2, \ldots, p_N of the integers 1 through N. For each valid i, you should assign the value A_{p_i} to vertex i. Then, you should choose a vertex of the tree and K-1 times, perform one of the foll…

Also, this is how you can search for a topic:

[knock_12]

Mad, Actually i was searching for profitable paths 2 rather than PRT2 that’s why it’s not showing results to me.NVM and thanks