[UVA][二分greedy] 11920 - 0 s, 1 s and ? Marks
0 s, 1 s and ? Marks
Given a string consisting of 0, 1 and ? only, change all the ? to 0/1, so that the size of the largest group is minimized.
A group is a substring that contains either all zeros or all ones.
Consider the following example:
...
