RE on 2-10

Stars154356 @ 2024-08-17 14:33:09

by LoveFrieren @ 2024-08-20 20:44:35

怎么说

by Stars154356 @ 2024-08-21 16:52:10

void dfs1(int u,int fa){

tim++;num[u]=tim;

dep[u]=dep[fa]+1;

son[u]=1;

for(int i=h[u];i;i=e[i].ne){

int y=e[i].to;

if(y==fa)return;

 dfs1(y,u);

 son[u]+=son[y];

    if(!hs[u]||son[hs[u]]<son[y]){
        hs[u]=y;
    }
}

}

by Stars154356 @ 2024-08-21 16:52:54

《半路 return 之星》