Hard Process (二分和尺取）

题意：就是有一个序列只有0和1，可以把k个0改为1，是连续的1的个数最多。

You are given an array a with n elements. Each element of a is either 0 or 1.

Let's denote the length of the longest subsegment of consecutive elements in a, consisting of only numbers one, as f(a). You can change no more than k zeroes to ones to maximize f(a).

Input

The first line contains two integers n and k (1 ≤ n ≤ 3·105, 0 ≤ k ≤ n) — the number of elements in a and the parameter k.

The second line contains n integers ai (0 ≤ ai ≤ 1) — the elements of a.

Output

On the first line print a non-negative integer z — the maximal value of f(a) after no more than k changes of zeroes to ones.

On the second line print n integers aj — the elements of the array a after the changes.

If there are multiple answers, you can print any one of them.

Examples

Input

7 1
1 0 0 1 1 0 1

Output

4
1 0 0 1 1 1 1

Input

10 2
1 0 0 1 0 1 0 1 0 1

Output

5
1 0 0 1 1 1 1 1 0 1

二分

#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;//二分 
int pre[300010];
int a[300010];
int main()
{
	int n,k;
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
	}
	memset(pre,0,sizeof(pre));
	for(int i=1;i<=n;i++)
	{
		if(a[i]==0)
		pre[i]=pre[i-1]+1;
		else pre[i]=pre[i-1];
	}
	int st=-1,ed=-1,ans=0;
	for(int i=1;i<=n;i++)
	{
		int l=i;
		int r=n;
		while(r>=l)
		{
			int mid=(l+r)/2;
			if(pre[mid]-pre[i-1]<=k)
			{
				if(ans<mid-i+1)
				{
					ans=mid-i+1;
					st=i;
					ed=mid;
				}
				l=mid+1;
			}
			else r=mid-1;
		}
	}
	printf("%d\n",ans);
	for(int i=1;i<=n;i++)
	{
		if(i>=st&&i<=ed)
		{
			if(i==1) printf("1");
			else printf(" 1");
		}
		else {
			if(i==1) printf("%d",a[i]);
			else printf(" %d",a[i]);
		}
	}
	printf("\n");
	return 0;
 } 

尺取

#include<stdio.h>
#define maxn 300010
int a[maxn];
int main()
{
	int n,k;
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
	}
	int l=1,r=1,ans=0,st=-1,ed=-1,num=0;
	while(r<=n)
	{
		while(r<=n)
		{
			if(a[r]==0)
			{
				if(num==k) break;
				else num++;
			}
			r++;
		}
		if(r-l>ans)
		{
			ans=r-l;
			st=l;
			ed=r-1;
		}
		while(l<=n&&a[l]) l++;
		l++,num--;
	}
	printf("%d\n",ans);
	for(int i=1;i<=n;i++)
	{
		if(i>=st&&i<=ed)
		{
			if(i==1) printf("1");
			else printf(" 1");
		}
		else {
			if(i==1) printf("%d",a[i]);
			else printf(" %d",a[i]);
		}
	}
	printf("\n");
	return 0;
 }