HDU 4912 Paths on the tree （树链剖分+线段树+DP）

#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=1e5+10;
const int maxm=5e5+10;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){if(y==0) return x;return gcd(y,x%y);}

int n,m;
vector<int> g[maxn];
vector<pii> p[maxn];
///线段树
int tree[maxn<<2];
void update(lrt,int pos,int v){
    if(l==r){
        tree[rt]=v;
        return ;
    }
    int mid=l+r>>1;
    if(pos<=mid) update(lson,pos,v);
    if(mid<pos) update(rson,pos,v);
    tree[rt]=tree[rt<<1]+tree[rt<<1|1];
}
int query(lrt,int L,int R){
    if(L<=l&&r<=R) return tree[rt];
    int mid=l+r>>1,ans=0;
    if(L<=mid) ans+=query(lson,L,R);
    if(mid<R) ans+=query(rson,L,R);
    return ans;
}
///树链剖分
int dep[maxn],fa[maxn],son[maxn],sz[maxn];
void dfs1(int u,int f){
    dep[u]=dep[f]+1,fa[u]=f,sz[u]=1,son[u]=0;
    for(auto v:g[u]) if(v^f){
        dfs1(v,u);
        sz[u]+=sz[v];
        if(sz[v]>sz[son[u]]) son[u]=v;
    }
}
int top[maxn],dfn[maxn],cnt=0;
void dfs2(int u,int f){
    dfn[u]=++cnt,top[u]=f;
    if(son[u]) dfs2(son[u],f);
    for(auto v:g[u]) if(v!=fa[u]&&v!=son[u])
        dfs2(v,v);
}
int LCA(int x,int y){
    while(top[x]^top[y]){
        if(dep[top[x]]<dep[top[y]]) swap(x,y);
        x=fa[top[x]];
    }
    if(dep[x]>dep[y]) swap(x,y);
    return x;
}
int dp[maxn],sum[maxn];
int Q(int x,int y){
    int ret=0;
    while(top[x]^top[y]){
        if(dep[top[x]]<dep[top[y]]) swap(x,y);
        ret+=query(1,n,1,dfn[top[x]],dfn[x]);
        x=fa[top[x]];
    }
    if(dep[x]>dep[y]) swap(x,y);
    ret+=query(1,n,1,dfn[x],dfn[y]);
    return ret;
}
void solve(int u,int f){
    dp[u]=sum[u]=0;
    for(auto v:g[u]) if(v!=f){
        solve(v,u);
        sum[u]+=dp[v];
    }
    dp[u]=sum[u];
    for(auto v:p[u]){
        dp[u]=max(dp[u],sum[u]+Q(v.fi,v.se)+1);
    }
    sum[u]-=dp[u];
    update(1,n,1,dfn[u],sum[u]);
}
int main(){
    ios::sync_with_stdio(false);/*
    freopen("d://in.txt","r",stdin);
    freopen("d://out.txt","w",stdout);*/
    while(cin>>n>>m){
        rep(i,1,n+1) g[i].clear(),p[i].clear();
        mst(tree,0),cnt=0;
        rep(i,1,n){
            int x,y;
            cin>>x>>y;
            g[x].push_back(y);
            g[y].push_back(x);
        }
        dfs1(1,0),dfs2(1,1);
        rep(i,0,m){
            int x,y;
            cin>>x>>y;
            int lca=LCA(x,y);
            p[lca].push_back(mk(x,y));
        }
        solve(1,0);
        cout<<dp[1]<<"\n";
    }
    return 0;
}