CF--Two Teams--STL应用

E. Two Teams

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

There are nn students standing in a row. Two coaches are forming two teams — the first coach chooses the first team and the second coach chooses the second team.

The ii-th student has integer programming skill aiai. All programming skills are distinct and between 11 and nn, inclusive.

Firstly, the first coach will choose the student with maximum programming skill among all students not taken into any team, and kk closest students to the left of him and kk closest students to the right of him (if there are less than kk students to the left or to the right, all of them will be chosen). All students that are chosen leave the row and join the first team. Secondly, the second coach will make the same move (but all students chosen by him join the second team). Then again the first coach will make such move, and so on. This repeats until the row becomes empty (i. e. the process ends when each student becomes to some team).

Your problem is to determine which students will be taken into the first team and which students will be taken into the second team.

Input

The first line of the input contains two integers nn and kk (1≤k≤n≤2⋅1051≤k≤n≤2⋅105) — the number of students and the value determining the range of chosen students during each move, respectively.

The second line of the input contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤n1≤ai≤n), where aiai is the programming skill of the ii-th student. It is guaranteed that all programming skills are distinct.

Output

Print a string of nn characters; ii-th character should be 1 if ii-th student joins the first team, or 2 otherwise.

Examples

input

Copy

5 2
2 4 5 3 1

output

Copy

11111

input

Copy

5 1
2 1 3 5 4

output

Copy

22111

input

Copy

7 1
7 2 1 3 5 4 6

output

Copy

1121122

input

Copy

5 1
2 4 5 3 1

output

Copy

21112

Note

In the first example the first coach chooses the student on a position 33, and the row becomes empty (all students join the first team).

In the second example the first coach chooses the student on position 44, and the row becomes [2,1][2,1] (students with programming skills [3,4,5][3,4,5] join the first team). Then the second coach chooses the student on position 11, and the row becomes empty (and students with programming skills [1,2][1,2] join the second team).

In the third example the first coach chooses the student on position 11, and the row becomes [1,3,5,4,6][1,3,5,4,6] (students with programming skills [2,7][2,7] join the first team). Then the second coach chooses the student on position 55, and the row becomes [1,3,5][1,3,5] (students with programming skills [4,6][4,6] join the second team). Then the first coach chooses the student on position 33, and the row becomes [1][1] (students with programming skills [3,5][3,5] join the first team). And then the second coach chooses the remaining student (and the student with programming skill 11 joins the second team).

In the fourth example the first coach chooses the student on position 33, and the row becomes [2,1][2,1] (students with programming skills [3,4,5][3,4,5] join the first team). Then the second coach chooses the student on position 11, and the row becomes empty (and students with programming skills [1,2][1,2] join the second team).

 

思路在代码里

#include "bits/stdc++.h"
using namespace std;
int a[200004];
int b[200004];
int ans[200004];
int main()
{
    int n,k;
    cin>>n>>k;
    set<int>s;
    vector<int>v;
    for (int i = 1; i <= n; ++i)
    {
        scanf("%d",&a[i]);//---
        b[a[i]]=i;//记录位置
        s.insert(a[i]);//将值插入集合
        v.push_back(i);//---放入容器
    }
    int cnt=0;
    while(!v.empty())
    {
        int x=*(--s.end());//取最大值 ，因为左开右闭。
        s.erase(--s.end());//删除
        int id=b[x];//取最大值位置
        ans[id]=cnt+1;//记录是哪一个队伍的
        int pos=lower_bound(v.begin(),v.end(),id)-v.begin();
        int pos1=pos;
        int c=k;//向右删除k个
        while(c--)
        {
            if(pos1+1==v.size())
                break;
            s.erase(a[v[pos1+1]]);//挨个删除数
            ans[v[pos1+1]]=cnt+1;
            v.erase(v.begin()+pos1+1);//容器删除
        }
        c=k;
        while(c--)
        {
            if(pos==0)
                break;
            s.erase(a[v[pos-1]]);
            ans[v[pos-1]]=cnt+1;
            v.erase(v.begin()+pos-1);
            pos--;//删除这个，是为了更新最大值所在的位置
        }
        v.erase(v.begin()+pos);//---
        cnt^=1;
    }
    for (int i = 1; i <= n; ++i)
    {
        printf("%d",ans[i]);
    }
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=200000+66;
const ll mod=1e9+7;
int n,k;
int a[maxn];
int p[maxn];
int ans[maxn];
vector<int>v;
set<int>s;
int main()
{
    scanf("%d %d",&n,&k);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        p[a[i]]=i;
        v.push_back(i);
        s.insert(a[i]);
    }
    int cnt=0;
    while(v.size())
    {
        int maxx=*(--s.end());
        s.erase(--s.end());
        int id=p[maxx];//最大值所在位置
        ans[id]=cnt+1;
        int pos=lower_bound(v.begin(),v.end(),id)-v.begin();
        int c=k;
        while(c--)
        {
            if(pos+1==v.size())break;
            s.erase(a[v[pos+1]]);//删除这个位置的数
            ans[v[pos+1]]=cnt+1;
            v.erase(v.begin()+pos+1);//---//
        }
        c=k;
        while(c--)
        {
            if(pos==0)break;
            s.erase(a[v[pos-1]]);//删除这个位置的数
            ans[v[pos-1]]=cnt+1;
            v.erase(v.begin()+pos-1);//---//
            pos--;
        }
        cnt^=1;
        v.erase(v.begin()+pos);
    }
    for(int i=1;i<=n;i++)
    {
        printf("%d",ans[i]);
    }
}