Alice and MinMax

CodeChefOpen on judge ↗

Alice gives Bob an array A1, A2, ..., AN . He asks him to find an integer Z between P and Q (both inclusive), such that,the function F(Z) = min( abs(A[1]-Z) , abs(A[2]-Z), abs(A[3]-Z) ,....., abs(A[N]-Z) ) is Maximized . Where abs(x-y) is absolute difference between x and y. As Alice is a busy person help him to find the number .If there are multiple solutions, print the smallest of all po

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