【P3128】最大流 Max-flow 树上差分之点差

P3128
FJ给他的牛棚的N(2≤N≤50,000)个隔间之间安装了N-1根管道，隔间编号从1到N。所有隔间都被管道连通了。

FJ有K(1≤K≤100,000)条运输牛奶的路线，第i条路线从隔间si运输到隔间ti。一条运输路线会给它的两个端点处的隔间以及中间途径的所有隔间带来一个单位的运输压力，你需要计算压力最大的隔间的压力是多少。
题解 因为是点差 所以 $s-->t$的路径都加一等价于
cnt[s]++,cnt[t]++,cnt[LCA]–,cnt[fa[Lca]]–;
所以我们只要用两个dfs处理出来 然后统计一下cnt的最大值即可

/*
    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 = 50025;
int p[MAX_N],eid,depth[MAX_N],fa[MAX_N][18],lg[MAX_N],cnt[MAX_N],ans;
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 x,int fath)
{
    for(int i = p[x];i+1;i=e[i].next)
    {
        int to = e[i].v;
        if(to==fath) continue;
        dfs_(to,x);
        cnt[x]+=cnt[to];
    }
    ans = max(ans,cnt[x]);
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,m,a,b;
    init();
    scanf("%d%d",&n,&m);
    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%d",&a,&b);
        add(a,b),add(b,a);
    }
    dfs(1,0);
    for(int i = 1;i<=m;++i)
    {
        scanf("%d%d",&a,&b);
        int LCA = lca(a,b);
        cnt[a]++,cnt[b]++,cnt[LCA]--,cnt[fa[LCA][0]]--;
    }
    dfs_(1,0);
    for(int i = 1;i<=n;++i) ans = max(ans,cnt[i]);
    printf("%d\n",ans);
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}