← All problemsSign in

Sum of Goodness

CodeChefRating 2167Open on judge ↗

You are given an array $A = A_1, A_2, \ldots, A_N$ of size $N$. Consider a subsequence $S = S_1, S_2, \ldots, S_M$ of $A$. Let us define the *Goodness* of subsequence $S$ as follows: - Sort the subsequence $S$ in non-decreasing order. - Then, the *Goodness* of subsequence $S$ is the number of indices such that $S_i = i,$ where $(1 \le i \le |S|).$ For example, suppose $A = [ 10, 3, 2, 5,

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