[CF]Codeforces Round #552 (Div. 3)(坑)

E. Two Teams

Description

There are 𝑛n 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 𝑖i-th student has integer programming skill 𝑎𝑖ai. All programming skills are distinct and between 11 and 𝑛n, inclusive.

Firstly, the first coach will choose the student with maximum programming skill among all students not taken into any team, and 𝑘k closest students to the left of him and 𝑘k closest students to the right of him (if there are less than 𝑘k 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 𝑛n and 𝑘k (1≤𝑘≤𝑛≤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 𝑛n integers 𝑎1,𝑎2,…,𝑎𝑛a1,a2,…,an (1≤𝑎𝑖≤𝑛1≤ai≤n), where 𝑎𝑖ai is the programming skill of the 𝑖i-th student. It is guaranteed that all programming skills are distinct。

output

Print a string of 𝑛n characters; 𝑖i-th character should be 1 if 𝑖i-th student joins the first team, or 2 otherwise.

Examples

Input

5 2
2 4 5 3 1

Output

11111

正确解法：

用链表。但是链表不会QAQ

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<list>
using namespace std;
typedef long long ll;
const int inf=0x7fffffff;
const int N=100000+100;
const int M=9999999;
const ll mod=1000000000+7;
int t,n,m,k,p,l,r,u,v;
int ans[N],cnt,flag,temp,sum;
int a[N];
char str;
struct node{
    int val,id;
    bool operator <(const node &S)const{
        return val<S.val;
    }
}e[N];
list<node>st;
list<node>::iterator it[N];
int main()
{
    scanf("%d %d",&n,&k);
    for(int i=1;i<=n;i++){
        scanf("%d",&e[i].val);
        e[i].id=i;
        st.push_back(e[i]);
        it[i]=--st.end();
    }
    sort(e+1,e+n+1);
    int pos=1;
    for(int i=n;i>=1;i--){
        if(!ans[e[i].id]){
            int now=e[i].id;
            ans[now]=pos;
            list<node>::iterator l=it[now],r=it[now];
            for(int j=1;j<=k;j++){
                if(l!=st.begin())--l;
                if(r!=--st.end())++r;
            }
            ++r;
            while(l!=r) {
                ans[l->id]=pos;
                l=st.erase(l);
            }
            pos=3-pos;
        }

    }
    for(int i=1;i<=n;i++)
        cout<<ans[i];
    cout<<endl;
    return 0;
}