codeforces D. Subsequence Hate - 前缀和枚举

codeforces D. Subsequence Hate - 前缀和枚举

题干

Shubham has a binary string s. A binary string is a string containing only characters “0” and “1”.

He can perform the following operation on the string any amount of times:

Select an index of the string, and flip the character at that index. This means, if the character was “0”, it becomes “1”, and vice versa.
A string is called good if it does not contain “010” or “101” as a subsequence — for instance, “1001” contains “101” as a subsequence, hence it is not a good string, while “1000” doesn’t contain neither “010” nor “101” as subsequences, so it is a good string.

What is the minimum number of operations he will have to perform, so that the string becomes good? It can be shown that with these operations we can make any string good.

A string a is a subsequence of a string b if a can be obtained from b by deletion of several (possibly, zero or all) characters.

Input
The first line of the input contains a single integer t (1≤t≤100) — the number of test cases.

Each of the next t lines contains a binary string s (1≤|s|≤1000).

Output
For every string, output the minimum number of operations required to make it good.

Example

input

7
001
100
101
010
0
1
001100

output
0
0
1
1
0
0
2

Note
In test cases 1, 2, 5, 6 no operations are required since they are already good strings.

For the 3rd test case: “001” can be achieved by flipping the first character — and is one of the possible ways to get a good string.

For the 4th test case: “000” can be achieved by flipping the second character — and is one of the possible ways to get a good string.

For the 7th test case: “000000” can be achieved by flipping the third and fourth characters — and is one of the possible ways to get a good string.

二进制字符串s，若干次操作：
翻转一个字符
好串为不存在序列为010或101的串（即所有的1和0都是连续出现的）
最少操作几次使s成为好串

知识点&算法

不能出现任何01交替的序列，意思就是所有01都是凑在一起出现的，0000011111,111110000这样子。
如果要翻转，我们枚举一个中点，中点及左侧全部置0/1，中点右侧全部置1/0。对于枚举的每个点取两种情况中更小的次数。
为了降低时间复杂度，我们用两个前缀和数组cnt0[i]和cnt1[i]来存储串前i位出现的0,1个数：
设串长为n，那么对于每个中点i来说，翻转的代价即为cnt0[i] + cnt1[n] - cnt1[i]（左置1右置0）和cnt1[i] + cnt0[n] - cnt0[i]（左置1右置0）

题解

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
string s;
int __,n,x,y,z,a,b,c,u,v,res;
int cnt0[1005],cnt1[1005];

int main()
{
    cin>>__;
    while(__--){
        cin>>s;
        n = s.length();
        res = 0x3f3f3f3f;
        memset(cnt0,0,sizeof(cnt0));
        memset(cnt1,0,sizeof(cnt1));
        cnt0[1] = s[0] == '0';
        cnt1[1] = s[0] == '1';
        for(int i = 2 ; i <= n ; ++i){
            cnt0[i] = cnt0[i-1] + (s[i-1] == '0');
            cnt1[i] = cnt1[i-1] + (s[i-1] == '1');
        }
        for(int i = 0 ; i <= n ; ++i){
            res = min(res,min(cnt0[i]+cnt1[n]-cnt1[i],cnt1[i]+cnt0[n]-cnt0[i]) );
        }
        cout<<res<<endl;
    }
	return 0;
}