cf1363B——Subsequence Hate

Subsequence Hate
$deception$
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\le t\le 100)$ — the number of test cases.

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

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

对样例进行分析，可以得出几种好的字符串的形式

001->001
100->100
101->001
010->000
0->0
1->1
001100->000000

猜的出来，要么全0，要么全1，要么一边是0，一边是1，要么反过来。
全1全0的情况最好解决，遍历一遍算出0和1的总数，然后取最小值就行了，我们用$sum0$和$sum1$来表示0和1的总数，$ans=min(sum0,sum1)$

假设我们在字符串的第$i$个位置，它前面有$pre0$个0和$pre1$个1，现在我要把它变成$000.i.111$这种形式，那么首先先把前面的1变成0，需要$pre1$次，再把后面的0变成1，需要$sum0-pre0$次，那么总的就是$pre1+sum0-pre0$，同理，变成$111.i.000$的形式同样可以得出来，是$pre0+sum1-pre1$，那么答案$ans=min(ans,min(pre1+sum0-pre0,pre0+sum1-pre1))$。

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
const double eps = 1e-7;
#define endl '\n'
#define pb(a) push_back(a)
#define ALL(x) x.begin(), x.end()
#define SIZE(x) int(x.size())

int main() {
    int t;
    scanf("%d", &t);
    while (t--) {
        string s;
        cin >> s;
        int sum1 = 0, sum0 = 0, ans = 0;
        for (int i = 0; i < SIZE(s); ++i) {
            sum1 += (s[i] == '1') ? 1 : 0;
            sum0 += (s[i] == '0') ? 1 : 0;
        }
        ans = min(sum1, sum0);  //全1或全0的情况
        int pre0 = 0, pre1 = 0;
        for (int i = 0; i < SIZE(s); ++i) {
            pre0 += (s[i] == '0') ? 1 : 0;
            pre1 += (s[i] == '1') ? 1 : 0;
            ans = min(ans, pre1 + (sum0 - pre0));  // 000..11
            ans = min(ans, pre0 + (sum1 - pre1));  // 111.00
        }
        printf("%d\n", ans);
    }
    return 0;
}