E. Two Teams

http://codeforces.com/contest/1154/problem/E

题意：把一组1~n的数组分到1，2队伍；每次一个对选剩下的人的最大的以及他周围k（左和右k个）；问最后各个的所属队伍；

思路：维护每个位置的左边下一个的位置l[i],右边下一个的位置r[i]；从最大的开始，如果没有被选那么每次按l[i]和r[i]跳到下一个位置；

反思：不是每次跳到的位置就是没选的！！要判断是否他被选了；

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x) memset(x,0,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=2e5+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}


map<int,int>mp;
int ans[maxn];
int l[maxn],r[maxn];
int n,k;
int a[maxn];
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    cin>>n>>k;
    for(int i=1;i<=n;i++)
    {

        int x;
        cin>>x;
        mp[x]=i;
        l[i]=i-1;
        r[i]=i+1;
        a[i]=x;
    }
    //for(int i=1;i<=n;i++) cout<<r[i]<<" ";
    int f=1;
    for(int i=n;i>=1;i--)
    {
        if(mp[i]!=0)
        {
            //cout<<i<<endl;
            int id=mp[i];
            //cout<<id<<endl;
            //cout<<"le:";
            //for(int j=1;j<=n;j++) cout<<l[j]<<" ";
            //cout<<endl;

            //cout<<"ri:";
            //for(int j=1;j<=n;j++) cout<<r[j]<<" ";
            //cout<<endl;
            //cout<<endl;


            mp[i]=0;

            int R=n+1,L=0;

            int num=0;
            ans[id]=f;

            //cout<<"ri:";
            for(int j=r[id];j<=n;j=r[j])
            {
                if(num>=k)
                {
                    R=j;
                    break;
                }
                //cout<<j<<" ";
                if(mp[a[j]]!=0)//！！！！！
                {
                    mp[a[j]]=0;
                    num++;
                    ans[j]=f;
                }

            }
            //cout<<endl;

            //cout<<"le:";
            num=0;
            for(int j=l[id];j>=1;j=l[j])
            {

                if(num>=k)
                {
                    L=j;
                    break;
                }
                //cout<<j<<" ";
                if(mp[a[j]]!=0)
                {
                    mp[a[j]]=0;
                    num++;
                    ans[j]=f;
                }

            }
            //cout<<endl;
            //fl();

            num=0;
            int nex=r[id];
            for(int j=nex;j<=n;j=nex)
            {
                if(num>=k)break;
                num++;
                nex=r[j];
                r[j]=R;
                l[j]=L;
            }

            num=0;
            nex=l[id];
            for(int j=nex;j>=1;j=nex)
            {
                if(num>=k)break;
                num++;
                nex=l[j];
                l[j]=L;
                r[j]=R;
            }

            r[id]=R;
            l[id]=L;

            //cout<<L<<" "<<R<<endl;
            f=f+1;
            if(f==3) f=1;
        }
    }
    for(int i=1;i<=n;i++)
    {
        cout<<ans[i];
    }
    cout<<endl;
    return 0;
}