Finding Second Maximum

CodeChefRating 2848Open on judge ↗

Chef is playing a game with his brother. Chef has a sequence of $N$ distinct integers (indexed from $1$), which he keeps hidden from his brother. Chef's brother should find the index of the second largest integer in this sequence. In order to do that, he may ask any number of questions of the following kind: "Is the $i$-th element of the sequence bigger than the $j$-th element?" Chef immediately a

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