codeforces 1041 c 乱搞

 

 

 

#include <bits/stdc++.h>

using namespace std;

struct po {
    int val;
    int id;
};
po a[200005];
vector<int> ans[200005];
map<int,int> mp;
struct node {
    int val;
    int wh;
    node(int _val,int _wh) {
        val = _val;
        wh = _wh;
    }
    bool operator < (const node &b) const {
        return val > b.val;
    }
};

bool cmp1(po x,po y) {
    return x.val < y.val;
}
bool cmp2(po x,po y) {
    return x.id < y.id;
}
int main() {


    int n,m,d;

    scanf("%d %d %d",&n,&m,&d);

    for(int i = 1; i <= n; i++) {
        scanf("%d",&a[i].val);
        a[i].id = i;
    }


    sort(a + 1,a + n + 1,cmp1);

    priority_queue<node> q;

    q.push(node(a[1].val,1));
    ans[1].push_back(a[1].val);
    int cnt = 1;
    for(int i = 2; i <= n; i++) {

        if(a[i].val - d > q.top().val) {
            ans[q.top().wh].push_back(a[i].val);
            q.push(node(a[i].val,q.top().wh));
            q.pop();
        }
        else {
            q.push(node(a[i].val,++cnt));
            ans[cnt].push_back(a[i].val);
        }
    }

    printf("%d\n",cnt);
    for(int i = 1; i <= cnt; i++) {
        for(int j = 0; j < ans[i].size(); j++) {
            mp[ans[i][j]] = i;
        }
    }

    sort(a + 1,a + n + 1,cmp2);

    for(int i = 1; i <= n; i++) {
        printf("%d ",mp[a[i].val]);
    }



    return 0;
}