题目链接
树上点差分(线差分改为l[x]++,l[y]++,l[lca]-=2)
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
const int maxn=50005;
int n,m;
int head[maxn*2],to[2*maxn],nex[2*maxn],cnt=0;
int find1[maxn][30],l[maxn],deep[maxn];
int ans=0;
void add(int q,int w)
{
nex[++cnt]=head[q];
to[cnt]=w;
head[q]=cnt;
}
void dfs(int u,int fa)
{
deep[u]=deep[fa]+1;
find1[u][0]=fa;
for(int i=1;(1<<i)<=deep[u];i++)
{
find1[u][i]=find1[find1[u][i-1]][i-1];
}
for(int i=head[u];i!=-1;i=nex[i])
{
if(to[i]!=fa) dfs(to[i],u);
}
}
int LCA(int a,int b)
{
if(deep[a]>deep[b]) swap(a,b);
for(int i=20;i>=0;i--)
{
if(deep[a]<=deep[b]-(1<<i)) b=find1[b][i];
}
if(a==b) return a;
for(int i=20;i>=0;i--)
{
if(find1[a][i]==find1[b][i]) continue;
else a=find1[a][i],b=find1[b][i];
}
return find1[a][0];
}
void get_sum(int u,int fa)
{
for(int i=head[u];i!=-1;i=nex[i])
{
if(to[i]==fa) continue;
get_sum(to[i],u);
l[u]+=l[to[i]];
}
ans=max(ans,l[u]);
}
int main()
{
memset(head,-1,sizeof(head));
scanf("%d%d",&n,&m);
int x,y;
for(int i=1;i<=n-1;i++)
{
scanf("%d%d",&x,&y);
add(x,y); add(y,x);
}
dfs(1,0);
for(int i=1;i<=m;i++)
{
scanf("%d%d",&x,&y);
l[x]++; l[y]++; l[LCA(x,y)]--; l[find1[LCA(x,y)][0]]--;
}
get_sum(1,0);
printf("%d\n",ans);
return 0;
}