【51nod1405 树的距离之和】 dfs

51nod1405
其实第一遍dfs预处理所有深度数组 dep ,容量大小数组 sz
然后我们发现如果统计出一个点的答案ans[u] 对于他的儿子v的答案为 ans[u] - sz(那么多的点减少一个长度为1的边) + n - sz （那么多的点增加一个长度为1的边）
然后第二次dfs求出所有答案即可

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
#pragma comment(linker, "/STACK:10240000,10240000")
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);

/*namespace sgt
{
    #define lc (rt<<1)
    #define rc (rt<<1\1)
    #define mid ((l+r)>>1)

    #undef lc
    #undef rc
    #undef mid
}*/
const int MAX_N = 100025;
ll ans[MAX_N];
int p[MAX_N],eid,n,sz[MAX_N],dep[MAX_N];
void init()
{
    memset(p,-1,sizeof(p));
    eid = 0;
}
struct edge
{
    int v,next;
}e[MAX_N<<1];
void add(int u,int v)
{
    e[eid].v = v;
    e[eid].next = p[u];
    p[u] = eid++;
}
void dfs(int u,int fa)
{
    sz[u] = 1;
    dep[u] = dep[fa]+1;
    for(int i = p[u];i+1;i=e[i].next)
    {
        int  v = e[i].v;
        if(v==fa) continue;
        dfs(v,u);
        sz[u]+=sz[v];
    }
}
void dfs_(int u,int fa)
{
    if(u!=1) ans[u] = ans[fa] + n - 2ll*sz[u];
    for(int i = p[u];i+1;i=e[i].next)
    {
        int v = e[i].v;
        if(v==fa) continue;
        dfs_(v,u);
    }
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int a,b;
    scanf("%d",&n);
    init();
    for(int i = 1;i<n;++i)
    {
        scanf("%d%d",&a,&b);
        add(a,b);
        add(b,a);
    }
    dfs(1,0);
    ll now = 0;
    for(int i = 2;i<=n;++i) now+=dep[i] - dep[1];
    ans[1] = now;
    dfs_(1,0);
    for(int i = 1;i<=n;++i) printf("%lld\n",ans[i]);
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}