Beautiful Trees

CodeChefOpen on judge ↗

N trees are aligned from left to right in a row. The ith tree from the left has the height Hi and the type Ci, an integer ranged from 1 to a given K, the number of types. Vivaan stares at the sequence of trees and wonders, how many strictly increasing ( in height ) beautiful subsequences are there? A subsequence is considered as beautiful if every of the K types appears at least one times in the

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI