【刷题】BZOJ 5249 [2018多省省队联测]IIIDX

#include<bits/stdc++.h>
#define ui unsigned int
#define ll long long
#define db double
#define ld long double
#define ull unsigned long long
const int MAXN=500000+10;
const double eps=1e-8;
int n,d[MAXN],cnt,e,to[MAXN<<1],nex[MAXN<<1],beg[MAXN],fa[MAXN],size[MAXN],ans[MAXN];
db k;
std::map< int,std::vector<int> > M;
template<typename T> inline T min(T x,T y){return x<y?x:y;}
template<typename T> inline T max(T x,T y){return x>y?x:y;}
#define Mid ((l+r)>>1)
#define ls rt<<1
#define rs rt<<1|1
#define lson ls,l,Mid
#define rson rs,Mid+1,r
struct SEG{
    int Mn[MAXN<<2],Ad[MAXN<<2];
    inline void PushUp(int rt)
    {
        Mn[rt]=min(Mn[ls],Mn[rs]);
    }
    inline void PushDown(int rt)
    {
        Mn[ls]+=Ad[rt];Mn[rs]+=Ad[rt];
        Ad[ls]+=Ad[rt];Ad[rs]+=Ad[rt];
        Ad[rt]=0;
    }
    inline void Build(int rt,int l,int r)
    {
        if(l==r)Mn[rt]=l;
        else
        {
            Build(lson);Build(rson);
            PushUp(rt);
        }
    }
    inline void Update(int rt,int l,int r,int L,int R,int k)
    {
        if(L<=l&&r<=R)Mn[rt]+=k,Ad[rt]+=k;
        else
        {
            if(Ad[rt])PushDown(rt);
            if(L<=Mid)Update(lson,L,R,k);
            if(R>Mid)Update(rson,L,R,k);
            PushUp(rt);
        }
    }
    inline int Query(int rt,int l,int r,int k)
    {
        if(l==r)return Mn[rt]>=k?l:l+1;
        else
        {
            if(Ad[rt])PushDown(rt);
            if(Mn[rs]>=k)return Query(lson,k);
            else return Query(rson,k);
        }
    }
};
SEG T;
#undef Mid
#undef ls
#undef rs
#undef lson
#undef rson
template<typename T> inline void read(T &x)
{
    T data=0,w=1;
    char ch=0;
    while(ch!='-'&&(ch<'0'||ch>'9'))ch=getchar();
    if(ch=='-')w=-1,ch=getchar();
    while(ch>='0'&&ch<='9')data=((T)data<<3)+((T)data<<1)+(ch^'0'),ch=getchar();
    x=data*w;
}
template<typename T> inline void write(T x,char c='\0')
{
    if(x<0)putchar('-'),x=-x;
    if(x>9)write(x/10);
    putchar(x%10+'0');
    if(c!='\0')putchar(c);
}
template<typename T> inline void chkmin(T &x,T y){x=(y<x?y:x);}
template<typename T> inline void chkmax(T &x,T y){x=(y>x?y:x);}
inline void insert(int x,int y)
{
    to[++e]=y;
    nex[e]=beg[x];
    beg[x]=e;
    to[++e]=x;
    nex[e]=beg[y];
    beg[y]=e;
}
inline void dfs(int x,int f)
{
    size[x]=1;fa[x]=f;
    for(register int i=beg[x];i;i=nex[i])
        if(to[i]==f)continue;
        else dfs(to[i],x),size[x]+=size[to[i]];
}
int main()
{
    read(n);scanf("%lf",&k);
    for(register int i=1;i<=n;++i)read(d[i]);
    std::sort(d+1,d+n+1,std::greater<int>());
    for(register int i=n;i>=1;--i)insert(i,(int)((db)i/k+eps));
    dfs(0,-1);
    for(register int i=1;i<=n;++i)M[d[i]].push_back(i);
    T.Build(1,1,n);
    for(register int i=1;i<=n;++i)
    {
        if(fa[i])T.Update(1,1,n,ans[fa[i]],n,size[i]);
        ans[i]=T.Query(1,1,n,size[i]);
        std::map< int,std::vector<int> >::iterator it=M.find(d[ans[i]]);
        ans[i]=it->second.back();
        it->second.pop_back();
        T.Update(1,1,n,ans[i],n,-size[i]);
    }
    for(register int i=1;i<=n;++i)write(d[ans[i]],' ');
    puts("");
    return 0;
}