C. Monsters And SpellsF. Equidistant Vertices D. Distance in Tree(树上dp) E. Fixed Points Problem - F - Codeforces Problem - D - Codeforces G. Minimal Coverage C. Baby Ehab Partitions Again E. Compressed Tree (树上dp) D. Array Collapse (dp+前缀和),(笛卡尔树)