codeforce1363B. Subsequence Hate

题目链接添加链接描述

给出一个二进制字符串，要求不能其任意不连续子串含有‘010’ ‘101’
如1001‘不符合要求，’1000‘符合要求

---

符合要求的字符串转换为由连续0和连续1拼接.因此遍历所有位置，将该位置前全置1，该位置后全置0；或该位置前全置0，该位置后全置1

#pragma GCC diagnostic error "-std=c++11"
#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define ll long long
#define Pair pair<int,int>
#define re return

#define getLen(name,index) name[index].size()
#define mem(a,b) memset(a,b,sizeof(a))
#define Make(a,b) make_pair(a,b)
#define Push(num) push_back(num)
#define rep(index,star,finish) for(register int index=star;index<finish;index++)
#define drep(index,finish,star) for(register int index=finish;index>=star;index--)
using namespace std;

template<class T> void _deb(const char *name,T val){
    cout<<name<<val<<endl;
}
const int maxn=1024;


int t;
char s[maxn];
int numOf0[maxn];
int numOf1[maxn];
int main(){
    scanf("%d",&t);
    while(t--){
        mem(s,0);

        scanf("%s",s+1);
        int last;
        for(int i=1;s[i]!=0;i++){
            int ele = s[i]-'0';
            numOf0[i]=numOf0[i-1]+(int)(ele==0);
            numOf1[i]=numOf1[i-1]+(int)(ele==1);
            last=i;
        }

        int ans=INT_MAX;
        for(int i=1;s[i]!=0;i++){
            ans=min(ans,numOf0[i]+(numOf1[last]-numOf1[i]));
            ans=min(ans,numOf1[i]+(numOf0[last]-numOf0[i]));
        }
        printf("%d\n",ans);
    }

    re 0;
}