Codeforces Round #327 (Div. 2)C. Median Smoothing

C. Median Smoothing

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

A schoolboy named Vasya loves reading books on programming and mathematics. He has recently read an encyclopedia article that described the method of median smoothing (or median filter) and its many applications in science and engineering. Vasya liked the idea of the method very much, and he decided to try it in practice.

Applying the simplest variant of median smoothing to the sequence of numbers a1, a2, ..., an will result a new sequence b1, b2, ..., bn obtained by the following algorithm:

• b1 = a1, bn = an, that is, the first and the last number of the new sequence match the corresponding numbers of the original sequence.
• For i = 2, ..., n - 1 value bi is equal to the median of three values ai - 1, ai and ai + 1.

The median of a set of three numbers is the number that goes on the second place, when these three numbers are written in the non-decreasing order. For example, the median of the set 5, 1, 2 is number 2, and the median of set 1, 0, 1 is equal to 1.

In order to make the task easier, Vasya decided to apply the method to sequences consisting of zeros and ones only.

Having made the procedure once, Vasya looked at the resulting sequence and thought: what if I apply the algorithm to it once again, and then apply it to the next result, and so on? Vasya tried a couple of examples and found out that after some number of median smoothing algorithm applications the sequence can stop changing. We say that the sequence is stable, if it does not change when the median smoothing is applied to it.

Now Vasya wonders, whether the sequence always eventually becomes stable. He asks you to write a program that, given a sequence of zeros and ones, will determine whether it ever becomes stable. Moreover, if it ever becomes stable, then you should determine what will it look like and how many times one needs to apply the median smoothing algorithm to initial sequence in order to obtain a stable one.

Input

The first input line of the input contains a single integer n (3 ≤ n ≤ 500 000) — the length of the initial sequence.

The next line contains n integers a1, a2, ..., an (ai = 0 or ai = 1), giving the initial sequence itself.

Output

If the sequence will never become stable, print a single number  - 1.

Otherwise, first print a single integer — the minimum number of times one needs to apply the median smoothing algorithm to the initial sequence before it becomes is stable. In the second line print n numbers separated by a space  — the resulting sequence itself.

Sample test(s)

input

4
0 0 1 1

output

0
0 0 1 1

input

5
0 1 0 1 0

output

2
0 0 0 0 0

Note

In the second sample the stabilization occurs in two steps: , and the sequence 00000 is obviously stable.

题目大意：

给你一个01串，每次更新2-n-1位数字等于左右数字的平均数，问多少次操作后这个01串会永远不改变，输出次数和结果。

解法：

其实三个相同数在一起时中间的数是永远不会改变的，因此我们用这一特性可以将一个长01串切割成许多子串，对于每一个01字串，再分奇偶考虑就行了，算是一道找规律的模拟题。

#include "iostream"
#include "cstdio"
#include "math.h"
using namespace std;
const int inf=0x3f3f3f;
int name[500001];
int main(int argc, char* argv[])
{
    int n,len=0;
    int num=0,minn=0;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
        scanf("%d",&name[i]);
    int flag=name[0];
    bool isok=false;
    for(int i=1;i<n;i++)
    {
        if(name[i]==flag)
        {
            if(isok)
            {
                len++;
                if(len%2==1)
                {
                    minn=max(minn,len/2);
                    for(int j=i-len;j<i;j++)
                        name[j]=name[i-1];
                }
                else
                {
                    minn=max(minn,len/2-1);
                    for(int j=i-len,k=i-1;j<k;j++,k--)
                    {
                        name[j]=name[i-len];
                        name[k]=name[i-1];
                    }
                }
                isok=false;
                len=0;
            }
            else
            {
                len=0;
                isok=false;
                flag=name[i];
            }
        }
        else
        {
            isok=true;
            flag=1-flag;
            len++;
        }
    }
    if(isok)
    {
        len++;
        if(len%2==1)
        {
            minn=max(minn,len/2);
            for(int j=n-len;j<n;j++)
                name[j]=name[n-1];
        }
        else
        {
            minn=max(minn,len/2-1);
            for(int j=n-len,k=n-1;j<k;j++,k--)
            {
                name[j]=name[n-len];
                name[k]=name[n-1];
            }
        }
    }
    printf("%d\n",minn);
    printf("%d",name[0]);
    for(int i=1;i<n;i++)
        printf(" %d",name[i]);
    printf("\n");
    return 0;
}