codeforces 660C Hard Process

原创 2016年06月01日 19:06:00


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.

Sample Input

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
题意: 给你N个数,让你改变其中的K个0为1;使得连1的长度最长
思路:把它看成是花费得到每个点对于第一个点的花费dp[i],按照二分查找的思想来写,在每一个位置上去找当前花费dp[i]+k的最小值所在的位置来记录比较
AC代码:
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>

using namespace std;

int n,k;
int dp[300005];
int a[300005];

int main() {
    memset(dp,0,sizeof(dp));
    cin >> n >> k;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        if(a[i] == 0) {
            dp[i] = dp[i-1]+1;
        } else {
            dp[i] = dp[i-1];
        }
    }
    int ans = 0;
    int s = 0;
    for(int i = 1; i <= n; i++) {
        int index;
        if(a[i] == 0) {//当前值为0说明当前的花费有一个
            index = upper_bound(dp,dp+n+1,dp[i]+k-1)-dp;
        } else {
            index = upper_bound(dp,dp+n+1,dp[i]+k)-dp;
        }
        if(index - i > ans) {
            ans = index-i;
            s = i;
        }
    }
    printf("%d\n",ans);
    int i;
    for(i = 1; i < s; i++) {
        printf("%d ",a[i]);
    }
    for(; i <= n && k != 0; i++) {
        printf("1 ");
        if(a[i] == 0) {
            k--;
        }
    }
    for(; i<= n; i++) {
        printf("%d ",a[i]);
    }
    return 0;
}
有进步啦

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

codeforces_660C. Hard Process(尺取法)

C. Hard Process time limit per test1 second memory limit per test256 megabytes inputstandard inpu...

Codeforces 660C-Hard Process【尺取法经典练习】

C. Hard Process time limit per test 1 second memory limit per test 256 megabytes in...

Codeforces 660C Hard Process【二分】经典题!好题!

C. Hard Process time limit per test 1 second memory limit per test 256 megabytes input standard i...

埃氏筛法+快速幂+dp SRM 660 Div 2 Hard: Powerit

You are given three ints: n, k, and m. For each i between 1 and n, inclusive, Fox Ciel calculated t...

Codeforces Round #367 (Div. 2) C. Hard problem(dp)

time limit per test1 second memory limit per test256 megabytesVasiliy is fond of solving different ...

codeforces 706 C. Hard problem #367 div2

顺序给出 n 个字符串,不能交换顺序,但每个串都可以反转(reverse),代价为 ci,问能不能使得这些字符串从前往后字典序是从小到大的,并算出最小代价 dp[2][n] 记录代价,dp[0][] ...

【Codeforces Round 367 (Div 2) C】【简单DP】Hard problem

C. Hard problem time limit per test 1 second memory limit per test 256 megabytes in...

Codeforces Round #367 (Div. 2) C. Hard problem (dp)

C. Hard problem time limit per test 1 second memory limit per test 256 megabytes input standar...

codeforces C. NP-Hard Problem 二分图的判定

C. NP-Hard Problem time limit per test 2 seconds memory limit per test 256 megabytes input sta...

Hard problem CodeForces - 706C (DP)

Vasiliy is fond of solving different tasks. Today he found one he wasn't able to solve himself, so h...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)