← All problemsSign in

Set Major (Prefix)

CodeChefRating 2027Open on judge ↗

**This is the easy version of the problem. The only difference with the easy version is that here, you need to only count the number of prefixes of the given array that are dominating - all constraints and definitions otherwise remain the same. This problem is worth $100$ points in divisions $2, 3,$ and $4$, and is not scored in division $1$.** An array $B$ of length $M$ is said to be *dominati

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

Sign in to chat with the tutor and save your progress.

Sign in to start