## [CF1137F]Matches Are Not a Child's Play(LCT)

Title Link
Given a rootless tree with \ (n \) points, define its deletion sequence: delete the leaf node with the smallest number in the tree and add it to the end of the sequence each time.
There are \ (q \) operations, which are divided into three types: set the number of a node to the maximum number of other nodes \ (+ 1 \); Query the posit ...

Added by **wilorichie** on *Wed, 10 Nov 2021 03:25:56 +0200*