题意: 求出最小删除字符数,以使二进制串s不含有"101"和"010"这样的子串。
思路:
- 可以看出,字符串不能出现’0’,'1’交替出现的情况。即只有"1111……",“0000……”,"1111……0000"和"0000……1111"这四种情况。
- 所以用前缀和记录一下’0’和’1’的个数再计算求个min就行啦
代码实现:
#include<bits/stdc++.h>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int inf = 0x7fffffff;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll mod = 1e9 + 7;
const int N = 2e5 + 5;
int t, sum0, sum1;
string s;
int q0[N], q1[N];
signed main()
{
IOS;
cin >> t;
while(t --){
s.clear();
me(q0); me(q1);
sum0 = 0, sum1 = 0;
cin >> s;
s = 'x' + s;
for(int i = 1; i < s.size(); i ++){
q0[i] = q0[i - 1] + (s[i] == '0');
q1[i] = q1[i - 1] + (s[i] == '1');
sum0 += (s[i] == '0');
sum1 += (s[i] == '1');
}
int ans = inf, last_one, last_zero;
for(int i = 1; i < s.size(); i ++){
last_one = sum1 - q1[i];
last_zero = sum0 - q0[i];
ans = min(ans, q1[i] + last_zero);
ans = min(ans, q0[i] + last_one);
}
cout << min(min(ans, q0[s.size() - 1]), min(ans, q1[s.size() - 1])) << endl;
}
return 0;
}