← All problemsSign in

All Aside

CodeChefRating 2062Open on judge ↗

You are given a **binary** string $S$ of length $N$. You can perform the following operation on it: - Choose an index $i$ ($1 \le i \le N$) - Let $[L, R]$ be the maximal segment of equal values containing index $i$. - More formally, $L$ is the smallest index such that $S_L = S_{L+1} = \ldots = S_i$, and $R$ is the largest index such that $S_i = S_{i+1} = \ldots = S_R$. - Flip the values at i

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