因为徐州现场赛的G是树上差分+组合数学，但是比赛的时候没有写出来(自闭)，背锅。
会差分数组但是不会树上差分，然后就学了一下。
看了一些东西之后，对树上差分写一点个人的理解：
首先要知道在树上，两点之间只有一条路径。树上差分就是在树上用差分数组，因为是在树上的操作，所以要用到lca，因为对于两点a，b，从a到b这一条链就是a-->lca(a,b)-->b，这是一条链。
其次，树上差分的两种操作：一种是对点权的，另一种是对边权的。
对于点权：
在树上将路径的起点a+1和终点b+1，lca(a,b)-1，lca(a,b)的爸爸-1，因为对于点权，从a到b包括lca(a,b)，因为lca其实是+2，lca(a,b)多算了一次，所以lca(a,b)-1，但是lca(a,b)往上的爸爸们都没有计算到，所以lca的爸爸-1就可以。总的代码就是
sum[a]++;sum[b]++;sum[lca]--;sum[fa[lca][]]--;
对于边权：
在树上，对于a和b，用深度更深的那个数表示边的编号，对于a和b连接的边，如果a是b的爸爸，那么这条边的编号就是b。
在树上将起点边a+1，终点边b+1，lca(a,b)-2，因为对于边权，从边a到边b，不包括lca(a,b)，因为lca(a,b)这一条边并不在从a到b的路径上，但是lca(a,b)其实多算了2次，所以要减去，就是lca(a,b)-2。
代码就是
sum[a]++;sum[b]++;sum[lca]-=;
其他的好像也没什么了，就是dfs的时候别写捞了就可以。
先贴一个关于点权的树上差分。
P3128 [USACO15DEC]最大流Max Flow
题目描述
Farmer John has installed a new system of N-1N−1 pipes to transport milk between the NN stalls in his barn (2 \leq N \leq 50,0002≤N≤50,000), conveniently numbered 1 \ldots N1…N. Each pipe connects a pair of stalls, and all stalls are connected to each-other via paths of pipes.
FJ is pumping milk between KK pairs of stalls (1 \leq K \leq 100,0001≤K≤100,000). For the iith such pair, you are told two stalls s_isi and t_iti, endpoints of a path along which milk is being pumped at a unit rate. FJ is concerned that some stalls might end up overwhelmed with all the milk being pumped through them, since a stall can serve as a waypoint along many of the KK paths along which milk is being pumped. Please help him determine the maximum amount of milk being pumped through any stall. If milk is being pumped along a path from s_isi to t_iti, then it counts as being pumped through the endpoint stalls s_isi and
t_iti, as well as through every stall along the path between them.
FJ给他的牛棚的N(2≤N≤50,000)个隔间之间安装了N-1根管道，隔间编号从1到N。所有隔间都被管道连通了。
FJ有K(1≤K≤100,000)条运输牛奶的路线，第i条路线从隔间si运输到隔间ti。一条运输路线会给它的两个端点处的隔间以及中间途径的所有隔间带来一个单位的运输压力，你需要计算压力最大的隔间的压力是多少。
输入输出格式
输入格式：
The first line of the input contains NN and KK.
The next N-1N−1 lines each contain two integers xx and yy (x \ne yx≠y) describing a pipe
between stalls xx and yy.
The next KK lines each contain two integers ss and tt describing the endpoint
stalls of a path through which milk is being pumped.
输出格式：
An integer specifying the maximum amount of milk pumped through any stall in the
barn.
输入输出样例
题目就是关于点权的，树上差分的模板题。直接代码。
代码:
//洛谷 P3128 [USACO15DEC]最大流Max Flow -树上差分(点的树上差分)
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<deque>
#include<iomanip>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii; const double PI=acos(-1.0);
const double eps=1e-;
const ll mod=1e9+;
const int inf=0x3f3f3f3f;
const int maxn=1e5+;
const int maxm=+;
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); struct node{
int to,next;
}edge[maxn<<]; int head[maxn<<],sum[maxn],dep[maxn],fa[maxn][],n,m,cnt,ans; int read()//加速挂
{
int res=;
char c=getchar();
while(c<''||c>'') c=getchar();
while(c>=''&&c<='') res=res*+c-'',c=getchar();
return res;
} void add(int x,int y){edge[++cnt].to=y,edge[cnt].next=head[x],head[x]=cnt;}//链式前向星存图 void dfs(int u,int fath)
{
dep[u]=dep[fath]+,fa[u][]=fath;
for (int i=;fa[u][i];++i) fa[u][i+]=fa[fa[u][i]][i];
for (int i=head[u];i;i=edge[i].next){
int v=edge[i].to;
if(v!=fath) dfs(v,u);
}
} int LCA(int u,int v)
{
if(dep[u]>dep[v]) swap(u,v);
for (int i=;i>=;--i) if(dep[u]<=dep[v]-(<<i)) v=fa[v][i];
if(u==v) return u;
for (int i=;i>=;--i) if(fa[u][i]!=fa[v][i]) u=fa[u][i],v=fa[v][i];
return fa[u][];
} void Dfs(int u,int fath)//最后的遍历操作
{
for (int i=head[u];i;i=edge[i].next){
int v=edge[i].to;
if(v==fath) continue;
Dfs(v,u);
sum[u]+=sum[v];
}
ans=max(ans,sum[u]);
} int main()
{
n=read(),m=read();
int x,y;
for (int i=;i<n;i++){
x=read(),y=read();
add(x,y);add(y,x);
}
dfs(,);
for (int i=;i<=m;++i){
x=read();y=read();
int lca=LCA(x,y);
++sum[x];++sum[y];--sum[lca];--sum[fa[lca][]];
}
Dfs(,);
printf("%d\n",ans);
return ;
}
溜了，本来昨天就改写的，忘了。