Maximum Number of Operations to Move Ones to the End

Given a binary string s, you may repeatedly pick any adjacent "10" and slide that '1' rightward over all following zeros until it hits another '1' or the string end; compute the maximum number of such operations you can perform. The core challenge is to reason about the optimal order of moves and count movable ones efficiently (greedy/inversion-style scan over the string).