Hard Process CodeForces - 660C （尺取法）

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.

Example
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

尺取法的使用，从前往后遍历，当遇到0 时就使用k 使它变1，直到再遇到0 并且 k==0,那么 就将起始点往后移动，找到一个0，将起始点放在该点后，如此循环，直到结束。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<algorithm>

#define ll long long
#define inf 0x3f3f3f3f
#define maxn 300007  

using namespace std;

int a[maxn];

int main()
{
    int n,k;
    scanf("%d%d",&n,&k);
    for(int i=0;i<n;i++)
        scanf("%d",&a[i]);

    int pi=0,pj=0;
    int ansi=0,ansj=0;

    while(1)
    {
        if(pj==n) break;

        if(a[pj]==1)
            pj++;
        else 
        {
            if(k>0) 
            {
                pj++;
                k--;
            }
            else 
            {
                while(a[pi] != 0)
                    pi ++;
                pi++;

                pj++;
            }
        }

//      printf("%d %d %d\n",pi,pj,k);
        if(pj-pi > ansj-ansi)
        {
            ansi = pi;
            ansj = pj;
        }
    }
//  printf("%d,%d\n",ansi,ansj);
    printf("%d\n",ansj-ansi);
    for(int i=0;i<n;i++)
    {
        if(ansi <= i && i < ansj)
            printf("%d%c",1,i==n-1?'\n':' ');
        else 
            printf("%d%c",a[i],i==n-1?'\n':' ');
    }

    return 0;
}