CodeForces - 660C Hard Process

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

题目大意：给你一个只有1和0组成的长度为n的数列，可以选择将其中任意k个0变为1 ，输出子序列全为1的最大长度，并输出改变后的任意一种序列

解题思路：用二分来做比较简单，借助数组b来记录第i个数之前有几个0，然后使用二分来做。

AC代码：然后从前往后遍历，当区间中0的个数小于等于K时，将L右移，反之将R左移，当区间长度大于ans时更新ans,并记录此时区间的左边和右边，以方便后面输出数列

AC代码：

#include<iostream>
#include<cstdio>
using namespace std;
const int maxn=3e5+10;
int a[maxn],b[maxn];
int main()
{
	int n,k;
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
		b[i]=b[i-1];
		if(a[i]==0)
			b[i]++;
	}
	int ans=0,left=0,right=0;
	for(int i=1;i<=n;i++)
	{
		int L=i;
		int R=n;
		while(L<=R)
		{
			int mid=(L+R)/2;
			if(b[mid]-b[i-1]<=k)//在i和mid之间0的个数小于k继续扩大区间； 
			{
				if(mid-i+1>ans)//mid-i+1表示此时区间长度 
				{
					ans=mid-i+1;
					left=i;
					right=mid;
				}
				L=mid+1;
			}
			else
				R=mid-1;
		}	
	}
	printf("%d\n",ans);
	for(int i=1;i<=n;i++)
	{
		if(i>=left&&i<=right)
		printf("1 ");
		else
		printf("%d ",a[i]);
	}
	printf("\n");
	return 0;
}