Codeforces Round #480 (Div. 2) C. Posterized

C. Posterized

Professor Ibrahim has prepared the final homework for his algorithm’s class. He asked his students to implement the Posterization Image Filter.

Their algorithm will be tested on an array of integers, where the $i$-th integer represents the color of the $i$-th pixel in the image. The image is in black and white, therefore the color of each pixel will be an integer between 0 and 255 (inclusive).

To implement the filter, students are required to divide the black and white color range [0, 255] into groups of consecutive colors, and select one color in each group to be the group’s key. In order to preserve image details, the size of a group must not be greater than $k$, and each color should belong to exactly one group.

Finally, the students will replace the color of each pixel in the array with that color’s assigned group key.

To better understand the effect, here is an image of a basking turtle where the Posterization Filter was applied with increasing $k$ to the right.

To make the process of checking the final answer easier, Professor Ibrahim wants students to divide the groups and assign the keys in a way that produces the lexicographically smallest possible array.

Input

The first line of input contains two integers $n$ and $k$ ($1\le n\le {10}^5$, $1\le k\le 256$), the number of pixels in the image, and the maximum size of a group, respectively.

The second line contains $n$ integers $p_1,p_2,\dots ,p_n$ ($0\le p_i\le 255$), where $p_i$ is the color of the $i$-th pixel.

Output

Print $n$ space-separated integers; the lexicographically smallest possible array that represents the image after applying the Posterization filter.

Examples

input

Copy

4 3
2 14 3 4

output

Copy

0 12 3 3

input

Copy

5 2
0 2 1 255 254

output

Copy

0 1 1 254 254

题意：给你n个数，把它们分组，每组元素不超过k，每组内最小的数是代表，随后输出。

思路：从a[i]-k+1到a[i]，尽可能多的向左分组，保证字典序最小，感觉比上一题水。

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<string>
#include<map>
#include<vector>
#include<queue>
#include<stack>
#include<set>
#define ll long long
#define exp 1e-8
#define mst(a,k) memset(a,k,sizeof(a))
using namespace std;
ll n,k,a[100010],w[100010];
int main()
{
    while(~scanf("%lld%lld",&n,&k))
    {
        for(ll i=1;i<=n;i++)scanf("%lld",&a[i]);
        mst(w,-1);
        for(ll i=1;i<=n;i++)
        {
            if(w[a[i]]==-1)
            {
                ll tmp=256;
                for(ll j=a[i]-k+1;j<=a[i];j++)   //从小开始找左端点
                {
                    if(j<0)continue;
                    if(w[j]==-1||w[j]==j)
                    {
                        tmp=j;
                        break;
                    }
                }
                for(ll k=tmp;k<=a[i];k++)   //从左到当前a[i]都分为组内
                {
                    w[k]=tmp;
                }
            }
        }
        for(ll i=1;i<=n;i++)
        {
            printf("%lld ",w[a[i]]);

        }
        printf("\n");
    }
    return 0;
}