Bit Inversions

CSESAdditional Problems IOpen on judge ↗

There is a bit string consisting of n bits. Then, there are some changes that invert one given bit. Your task is to report, after each change, the length of the longest substring whose each bit is the same. Input The first input line has a bit string consisting of n bits. The bits are numbered 1,2,\ldots,n. The next line contains an integer m: the number of changes. The last line contains m in

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