Submission #69860587

---

Source Code Expand

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;

int main(){
    int t;
    cin >> t;
    while(t--){
        int n;
        string s;
        cin >> n >> s;

        int ans = INT_MAX;
        vector<int> cnt(2, 0);
        for(int i = 0; i < n; i++){
            if(s[i] == '0') cnt[0]++;
            else cnt[1]++;
        }

        for(int i = 0; i < n; i++){
            // cout << i << endl;
            int j;
            for(j = i; j < n; j++){
                if(s[i] != s[j]) break;
            }

            int v;
            if(s[i] == '0') v = min(cnt[0] - (j-i), cnt[1]);
            else v = min(cnt[0], cnt[1] - (j-i));
            ans = min(ans, i + n-j + v);

            i = j-1;
        }
        cout << ans << endl;
    }
}

Submission Info

Judge Result