洛谷P3128 [USACO15DEC]最大流Max Flow
标签
- 树链剖分
简明题意
- 给一棵树,再给m个操作,每个操作都是让你给u-v的路径上所有节点+1,最后问你最大的节点是多少
思路
- 太裸了,树剖,剖完后用差分维护下,最后还原成原数组找到最大值即可。太简单了
注意事项
- 无
总结
- 无
AC代码
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
const int maxn = 5e4 + 10;
int n, m;
vector<int> g[maxn];
int fa[maxn], dep[maxn], son[maxn], siz[maxn];
void dfs1(int u, int f, int deep)
{
fa[u] = f;
dep[u] = deep;
siz[u] = 1;
int maxson = -1;
for (auto& v : g[u])
if (v != f)
{
dfs1(v, u, deep + 1);
siz[u] += siz[v];
if (siz[v] > maxson)
maxson = siz[v], son[u] = v;
}
}
int top[maxn], id[maxn], cnt;
void dfs2(int u, int topf)
{
id[u] = ++cnt;
top[u] = topf;
if (son[u])
{
dfs2(son[u], topf);
for (auto& v : g[u])
if (v != fa[u] && v != son[u])
dfs2(v, v);
}
}
int cf[maxn], a[maxn];
void solve()
{
scanf("%d%d", &n, &m);
for (int i = 1; i < n; i++)
{
int u, v;
scanf("%d%d", &u, &v);
g[u].push_back(v), g[v].push_back(u);
}
dfs1(1, 1, 1);
dfs2(1, 1);
while (m--)
{
int u, v;
scanf("%d%d", &u, &v);
while (top[u] != top[v])
{
if (dep[top[v]] < dep[top[u]]) swap(u, v);
cf[id[top[v]]] += 1, cf[id[v] + 1] -= 1;
v = fa[top[v]];
}
cf[min(id[u], id[v])] += 1, cf[max(id[u], id[v]) + 1] -= 1;
}
int ans = 0;
for (int i = 1; i <= n; i++)
a[i] = a[i - 1] + cf[i], ans = max(ans, a[i]);
printf("%d", ans);
}
int main()
{
freopen("Testin.txt", "r", stdin);
solve();
return 0;
}
双倍经验
- 无