题意:
n个数 只有 0 1, 可以将<=k 个 0 改成1 使得最终序列中的子串全为1 且最长 ,并输出
思路: 枚举左端点,二分右端点
#include<bits/stdc++.h>
using namespace std;
const int maxn = 3*100010;
int sum[maxn];
int a[maxn];
int n ,k;
int erfen(int i)
{
int l = i;
int r = n;
int mid;
while(l<=r)
{
mid = (l+r)>>1;
if(sum[mid]-sum[i-1]<=k)//当恰好等于k时端点应向右走,
{
l = mid+1;
}
else
r = mid-1;
}
return l-1 ;
}
int main()
{
scanf("%d%d",&n,&k);
for(int i = 1; i<=n; i++)
{
scanf("%d",&a[i]);
if(a[i]==0)
sum[i] = sum[i-1]+1;
else sum[i] = sum[i-1];
}
int ans = 0;
int l,r;
for(int i = 1; i<=n; i++)
{
int f = erfen(i);
if(f-i+1>ans)
{
l = i;
r = f;
ans = f-i+1;
}
}
printf("%d\n",ans);
for(int i = 1; i<=n; i++)
{
if(i>=l&&i<=r)
{
if(a[i]==0)
a[i] = 1;
}
printf("%d ",a[i]);
}
return 0;
}