← All problemsSign in

Meximal Sum

CodeChefRating 2444Open on judge ↗

You are given an integer array $A$ containing $N$ elements. A pair $(L,R)$,$(1 \le L < R < N)$ is called *good pair* if: - *MEX* $(A[1, \cdots L])$ $=$ *MEX*$(A[L+1 \cdots R])$ $=$ *MEX*$(A[R+1 \cdots N])$ where *MEX* of an array denotes the minimal non-negative integer which is not present in that array. Now Your task is to find both **minimum** and **maximum** value of *SUM*$(A[1 \cdots L])$

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