(C) Max-Min Game

CodeChefOpen on judge ↗

Shashikant has crush on a girl and she is good at competitive programming. To impress her, he has to solve as much problems as he can of this contest but he stuck here. Can you help him out to solve this problem. You are given an array $a = [a_1, a_2.....a_n]$ of size $n$ and an integer $k$. A sub-sequence of $a$ is defined as a sequence that can be obtained from $a$ by deleting some elements

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