[BZOJ3631][JLOI2014]松鼠的新家

#include <iostream>
#include <cstdio>
#include <queue>
#include <cstdlib>
using namespace std;
#define reg register 
inline int read() {
    int res = 0;char ch=getchar();
    while(!isdigit(ch)) ch=getchar();
    while(isdigit(ch)) res=(res<<3)+(res<<1)+(ch^48), ch=getchar();
    return res;
}
#define N 300005

int n;

struct edge {
    int nxt, to;
}ed[N*2];
int head[N], cnt;
inline void add(int x, int y)
{
    ed[++cnt] = (edge){head[x], y};
    head[x] = cnt;
}
int a[N];

bool vis[N];
int dep[N];
int f[N][20];

inline void bfs()
{
    dep[0] = -1;
    dep[1] = 1;
    queue <int> q;
    q.push(1);
    while(!q.empty())
    {
        int x = q.front();q.pop();
        for (reg int i = head[x] ; i ; i = ed[i].nxt)
        {
            int to = ed[i].to;
            if (dep[to]) continue;
            dep[to] = dep[x] + 1;
            q.push(to);
            f[to][0] = x;
            for (reg int j = 1 ; j <= 19 ; j ++)
                f[to][j] = f[f[to][j-1]][j-1];
        }
    }
}

inline int lca(int x, int y)
{
    if (dep[x] < dep[y]) swap(x, y);
    for (reg int i = 19 ; i >= 0 ; i --)
        if (dep[f[x][i]] >= dep[y]) x = f[x][i];
    if (x == y) return x;
    for (reg int i = 19 ; i >= 0 ; i --)
        if (f[x][i] != f[y][i]) x = f[x][i], y = f[y][i];
    return f[x][0];
}

int cf[N], ans[N];

void dfs(int x)
{
    ans[x] = cf[x];
    for (reg int i = head[x] ; i ; i = ed[i].nxt)
    {
        int to = ed[i].to;
        if (to == f[x][0]) continue;
        dfs(to);
        ans[x] += ans[to];
    }
}

int main()
{
    n = read();
    for (reg int i = 1 ; i <= n ; i ++) a[i] = read();
    for (reg int i = 1 ; i < n ; i ++)
    {
        int x = read(), y = read();
        add(x, y), add(y, x);
    }
    bfs();
    for (reg int i = 1 ; i <= n - 1 ; i ++)
    {
        int x = a[i], y = a[i+1];
        int l = lca(x, y);
        cf[x]++, cf[y]++;
        cf[l]--, cf[f[l][0]]--;
    }
    dfs(1);
    for (reg int i = 2 ; i <= n ; i ++) ans[a[i]]--; 
    for (reg int i = 1 ; i <= n ; i ++)
        printf("%d\n", ans[i]);
    return 0;
}