Maximum partitions

You are given a binary string $s$ of length $n$ containing only '0's and '1's. You have to split $s$ into multiple substrings like $s[1...r_1], s[r_1+1...r_2],...s[r_k+1...n]$ where $1 \leq r_1$ < $r_2$ < ... < $r_k$ < $n$, such that each of them contains strictly more number of '1's than '0's. Find the maximum number of substrings into which $s$ can be split. It is guaranteed that $s$ contains mo