A 牛牛冲钻五 模拟,逐位处理判断前三位即可 #include <bits/stdc++.h> using namespace std; #define rep(i, j, k) for (ll(i) = (j); (i) <= (k); (++i)) typedef long long ll; void solve() { int n, k; string s; cin >> n >> k >> s; int ans = 0, sz = s.size() - 1; rep(i, 0, sz) ...