Important Sisters HDU - 4694（支配树）

我不会。

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

const int maxn=1e5+7;
const int maxm=2e5+7;
vector<int> dt[maxn];

struct Edge{
    int v,next;
}edge[maxm];

//正向图,反向图;
int headG[maxn],headrG[maxn],top;

//父亲,时间戳,时间戳,时间戳对应的节点;
int fa[maxn], idx[maxn], clk, ridx[maxn];
int c[maxn], best[maxn], semi[maxn], idom[maxn];
//                      最远半必经点,最近必经点;

void init(int n){
    clk=0;
    for(int i=1;i<=n;++i) dt[i].clear();
    memset(c,-1,sizeof(c));
    memset(headG,-1,sizeof(headG));
    memset(headrG,-1,sizeof(headrG));
    top=0;
    for(int i=1;i<=n;++i) semi[i]=best[i]=i;
    memset(idx,0,sizeof(idx));
}

void add(int u,int v,int head[]){
    edge[top].v=v;
    edge[top].next=head[u];
    head[u]=top++;
}

void dfs(int u){
    idx[u]=++clk;
    ridx[clk]=u;
    int v;
    for(int i=headG[u];i!=-1;i=edge[i].next){
        v=edge[i].v;
        if(!idx[v]) {
            fa[v]=u;
            dfs(v);
        }
    }
}

int fix(int x){
    if(c[x]==-1) return x;
    int &f=c[x],rt=fix(f);
    if(idx[semi[best[x]]]>idx[semi[best[f]]]) best[x]=best[f];
    return f=rt;
}

void go(int rt){
    dfs(rt);
    for(int i=clk;i>1;--i){
        int x=ridx[i],mn=clk+1;
        for(int j=headrG[x];j!=-1;j=edge[j].next){
            int u=edge[j].v;
            if(!idx[u]) continue;//可能不能到达所有点;
            fix(u);
            mn=min(mn,idx[semi[best[u]]]);
        }
        c[x]=fa[x];
        dt[ semi[x]=ridx[mn] ].push_back(x);
        x=ridx[i-1];
        for(int j=0;j<dt[x].size();++j){
            int u=dt[x][j];
            fix(u);
            if(semi[best[u]]!=x) idom[u]=best[u];
            else idom[u]=x;
        }
        dt[x].clear();
    }
    for(int i=2;i<=clk;++i){
        int u=ridx[i];
        if(idom[u]!=semi[u]) idom[u]=idom[idom[u]];
        dt[idom[u]].push_back(u);
    }
}

ll ans[maxn];
int n;
ll getans(int x){
    if(x==n) return n;
    if(ans[x]) return ans[x];
    return ans[x]=getans(idom[x])+x;
}
int main(){
    int m,u,v;
    while(scanf("%d%d",&n,&m)!=EOF){
        init(n);
        while(m--){
            scanf("%d%d",&u,&v);
            add(u,v,headG);
            add(v,u,headrG);
        }
        go(n);
        if(idx[1]) printf("%lld",getans(1));
        else printf("0");
        for(int i=2;i<=n;++i)
            if(idx[i]) printf(" %lld",getans(i));
            else printf(" 0");
        printf("\n");

        for(int i=1;i<=n;++i) ans[i]=0;

    }
    return 0;
}