Good Indices

CodeChefRating 2934Open on judge ↗

Chef has an array $A$ of length $N$. He calls an index $i$ $(1 \leq i \leq N)$ *good* if there exists some $j \neq i$ such that $A_i = A_j$. Chef can perform the following operation **at most once**: - Choose any [subsequence](https://en.wikipedia.org/wiki/Subsequence) of the array $A$ and add any **positive** integer to all the elements of the chosen subsequence. Determine the **maximum** num

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