题目链接:P3128 [USACO15DEC] Max Flow P - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)
题意:
n(2<=n<=5e4)个隔间之间安装了N-1根管道,隔间的编号从1到N。所有的隔间都被管道连通了。同时它还有k(1<=k<=1e5)条运输牛奶的路线,第i条路线从隔间si运输到隔间ti。一条运输路线会给它的两个端点处的隔间以及中间途径的所有隔间带来一个单位的运输压力,求压力最大的隔间的压力是多少。
题解:
树上差分的详细解释(树上差分详解 - TEoS - 博客园 (cnblogs.com))
先是利用链表建树,将各个节点联系起来,然后假设一条u到v的路径,那么这条路径是u--->lca(u,v)--->v的,所以我们把u--->lca(u,v)与lca(u,v)--->v两条路径各自加1,也就是++power[u],++power[v],power[lca(u,v)]-=2
但是这样一来,lca(u,v)上+2又-2等于0,也就是u--->v整条路经上除了lca(u,v)都加了1,为了排除这个干扰,我们把power[lca(u,v)]-=2改成- -power[lca(u,v)],- -power[lca(u,v)的父亲],
LCA用倍增(倍增法求Lca(最近公共祖先)_倍增求lca_姬小野的博客-CSDN博客)比较方便,最后遍历整棵树统计和。
#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string.h>
#include<map>
#include<queue>
#include<vector>
#include<set>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
const ll mm = 5e4 + 60;
struct node {
int to, next;
};
node edge[mm << 2];
int head[mm << 2], power[mm], n, m, d[mm], fa[mm][30], ans, num;
inline void add(int x, int y)
{
edge[++num].to = y;
edge[num].next = head[x];
head[x] = num;
}
inline void work(int u, int fath)
{
d[u] = d[fath] + 1;
fa[u][0] = fath;
for (int i = 0; fa[u][i]; i++) fa[u][i + 1] = fa[fa[u][i]][i];
for (int i = head[u]; i; i = edge[i].next) {
int e = edge[i].to;
if (e != fath) work(e, u);
}
}
inline int Lca(int u, int v)
{
if (d[u] > d[v]) swap(u, v);
for (int i = 20; i >= 0; i--)
{
if (d[u] <= d[v] - (1 << i)) v = fa[v][i];
}
if (u == v) return u;
for (int i = 20; i >= 0; i--) {
if (fa[u][i] != fa[v][i])
{
u = fa[u][i];
v = fa[v][i];
}
}
return fa[u][0];
}
inline void Get(int u, int fath)
{
for (int i = head[u]; i; i = edge[i].next)
{
int e = edge[i].to;
if (e == fath) continue;
Get(e, u);
power[u] += power[e];
}
ans = max(ans, power[u]);
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
int x, y;
for (int i = 1; i < n; i++)
{
cin >> x >> y;
add(x, y);
add(y, x);
}
work(1, 0);
for (int i = 1; i <= m; i++)
{
cin >> x >> y;
int lca = Lca(x, y);
++power[x];
++power[y];
--power[lca];
--power[fa[lca][0]];
}
Get(1, 0);
cout << ans << endl;
return 0;
}