【P3258 松鼠的家】 树上差分 - 点差分

P3258
其实和上一道P3218 有点像的
但是我们处理的时候要知道 除了arr[1]这个点 他下面所有的点再访问是不会吃糖的 比如你到了2 从2开始 实际上只有一颗糖 所以我们要从 2 - n cnt[arr[i]]–；
代码如下

/*
    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>
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);

const int MAX_N = 300025;
int p[MAX_N],eid,cnt[MAX_N],depth[MAX_N],fa[MAX_N][20],arr[MAX_N],lg[MAX_N];
struct edge
{
    int v,next;
}e[MAX_N<<1];
void init()
{
    memset(p,-1,sizeof(p));
    eid = 0;
}
void add(int u,int v)
{
    e[eid].v = v;
    e[eid].next = p[u];
    p[u] = eid++;
}
void dfs(int x,int fath)
{
    depth[x] = depth[fath] + 1;
    fa[x][0] = fath;
    for(int i = 1;(1<<i)<=depth[fath];++i)
        fa[x][i] = fa[fa[x][i-1]][i-1];
    for(int i = p[x];i+1;i=e[i].next)
    {
        int to = e[i].v;
        if(to==fath) continue;
        dfs(to,x);
    }
}
int lca(int x,int y)
{
    if(depth[x]<depth[y])
        swap(x,y);
    while(depth[x]>depth[y])
        x = fa[x][lg[depth[x]-depth[y]]-1];
    if(x==y)
        return x;
    for(int k = lg[depth[x]]-1;k>=0;--k)
        if(fa[x][k]!=fa[y][k])
        x = fa[x][k],y = fa[y][k];
    return fa[x][0];
}
void dfs_(int u,int fath)
{
    for(int i = p[u];i+1;i=e[i].next)
    {
        int to = e[i].v;
        if(to==fath) continue;
        dfs_(to,u);
        cnt[u]+=cnt[to];
    }
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,a,b;
    init();
    scanf("%d",&n);
    for(int i = 1;i<=n;++i)
        lg[i] =lg[i-1] + (1<<lg[i-1]==i);
    for(int i = 1;i<=n;++i) scanf("%d",&arr[i]);
    for(int i = 1;i<n;++i)
    {
        scanf("%d%d",&a,&b);
        add(a,b),add(b,a);
    }
    dfs(arr[1],0);
    for(int i = 2;i<=n;++i)
    {
        a = arr[i-1],b = arr[i];
        int la = lca(a,b);
        cnt[la]--;cnt[fa[la][0]]--;
        cnt[arr[i-1]]++,cnt[arr[i]]++;
    }
    dfs_(arr[1],0);
    for(int i = 2;i<=n;++i) cnt[arr[i]]--;
    for(int i = 1;i<=n;++i) printf("%d\n",cnt[i]);
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}