Why greedy fails in CHEFTRIP?

[rishup_nitdgp]

Here a case for which your output is wrong.

1
6 1
1 2
1 3
4 5
4 6
5 3
6 3 2 5 4 2
3 4

Also refer the editorial for the solution:

CHEFTRIP - Editorial

PROBLEM LINK: Practice Contest Author: Ritesh Gupta Tester: Raja Vardhan Reddy Editorialist: Akash Bhalotia DIFFICULTY: Medium PREREQUISITES: Lowest Common Ancestor, Depth-First Search, Dynamic Programming. PROBLEM: Given a tree with N vertices, each having a value A_i, find if the sequence formed by the path from a query vertex x_1 to a query vertex x_L holds the property: A_{x_1}<A_{x_2}<…<A_{x_p}>…>A_{x_{L−1}}>A_{x_L} for some integer p (1 \le p \le L). HINTS: Not the full solut…