Codeforces 660 C. Hard Process (尺取)

题目链接：http://codeforces.com/problemset/problem/660/C

尺取法

 #include <bits/stdc++.h>
 using namespace std;
 int main()
 {
     static int num[int(3e5 + )];
     int n, k;
     scanf("%d %d", &n, &k);
     for(int i = ; i <= n; ++i) {
         scanf("%d", num + i);
     }
     int l = , res = , cnt = , flagl = , flagr = -;
     for(int i = ; i <= n; ++i) {
         if(num[i]) {
             if(i - l +  > res) {
                 res = i - l + , flagl = l, flagr = i;
             }
         } else {
             cnt++;
             while(cnt > k && l <= i) {
                 if(!num[l++])
                     --cnt;
             }
             if(i - l +  > res) {
                 res = i - l + , flagl = l, flagr = i;
             }
         }
     }
     for(int i = flagl; i <= flagr; ++i)
         num[i] |= ;
     printf("%d\n", res);
     for(int i = ; i <= n; ++i) {
         printf("%d%c", num[i], i == n ? '\n': ' ');
     }
     return ;
 }