题目描述
blablabla
样例
blablabla
双指针+前缀和
时间复杂度 $O(n)$
参考文献
C++ 代码
#include<iostream>
using namespace std;
#define endl '\n'
int a[300010];
int s[300010];
int n, k;
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
s[i] = s[i - 1] + (a[i]^1);
}
int l = 1;
int ans = -1, al = 0;
for (int i = 1; i <= n; i++) {
//维护到i为止的区间,0的个数最大为k
while (s[i] - s[l - 1] > k)l++;
if (ans < i - l + 1) {
ans = i - l + 1;
al = l;
}
}
for (int i = al; i < al + ans; i++)a[i] = 1;
cout << ans << endl;
for (int i = 1; i <= n; i++) cout << a[i] << " ";
return 0;
}