洛谷P3128 [USACO15DEC]最大流Max Flow
来源:互联网 发布:剑三dbm数据网盘 编辑:程序博客网 时间:2024/05/22 08:06
题目描述
Farmer John has installed a new system of N−1 pipes to transport milk between the N stalls in his barn (2≤N≤50,000), conveniently numbered 1…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 K pairs of stalls (1≤K≤100,000). For the ith such pair, you are told two stalls si and ti, 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 Kpaths 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 si to ti, then it counts as being pumped through the endpoint stalls si and
ti, 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 N and K.
The next N−1 lines each contain two integers x and y (x≠y) describing a pipe
between stalls x and y.
The next K lines each contain two integers s and t 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.
输入输出样例
5 103 41 54 25 45 45 43 54 34 31 33 55 41 53 4
9
想了好久才想到用 LCA+树上差分。。。
附代码:
#include<iostream>#include<algorithm>#include<cstdio>#define MAXN 100010using namespace std;int n,m,ans=0,c=1;int head[MAXN<<1],f[MAXN][20],deep[MAXN],s1[MAXN],s2[MAXN];struct node{ int next,to;}a[MAXN<<1];inline int read(){ int date=0,w=1;char c=0; while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();} while(c>='0'&&c<='9'){date=date*10+c-'0';c=getchar();} return date*w;}void add(int x,int y){ a[c].to=y; a[c].next=head[x]; head[x]=c++; a[c].to=x; a[c].next=head[y]; head[y]=c++;}void buildtree(int rt){ int will; for(int i=head[rt];i;i=a[i].next){ will=a[i].to; if(!deep[will]){ deep[will]=deep[rt]+1; f[will][0]=rt; buildtree(will); } }}void step(){ for(int i=1;i<=19;i++) for(int j=1;j<=n;j++) f[j][i]=f[f[j][i-1]][i-1];}int LCA(int x,int y){ if(deep[x]<deep[y])swap(x,y); for(int i=19;i>=0;i--) if(deep[f[x][i]]>=deep[y]) x=f[x][i]; if(x==y)return x; for(int i=19;i>=0;i--) if(f[x][i]!=f[y][i]){ x=f[x][i]; y=f[y][i]; } return f[x][0];}void work(int x,int y){ int fa=LCA(x,y); s1[x]++;s1[y]++;s1[fa]--; if(f[fa][0]!=0)s1[f[fa][0]]--;}void getsum(int now,int rt){ int t; s2[now]=s1[now]; for(int i=head[now];i;i=a[i].next){ t=a[i].to; if(t!=rt){ getsum(t,now); s2[now]+=s2[t]; } } ans=max(ans,s2[now]);}int main(){ int x,y; n=read();m=read(); for(int i=1;i<n;i++){ x=read();y=read(); add(x,y); s1[i]=deep[i]=0; } deep[1]=1; buildtree(1); step(); while(m--){ x=read();y=read(); work(x,y); } getsum(1,0); printf("%d\n",ans); return 0;}
- 洛谷 P3128 [USACO15DEC]最大流Max Flow
- 洛谷P3128 [USACO15DEC]最大流Max Flow
- 洛谷 P3128 [USACO15DEC] 最大流Max Flow
- 洛谷 P3128 [USACO15DEC]最大流Max Flow
- 洛谷P3128 [USACO15DEC]最大流Max Flow
- P3128 [USACO15DEC]最大流Max Flow
- [USACO15DEC]最大流Max Flow
- [USACO15DEC]最大流Max Flow
- [USACO15DEC]最大流Max Flow题解
- [USACO15DEC]最大流
- POJ 1149 最大流/max flow
- 【学术篇】树上差分--洛谷3128最大流Max Flow
- 最大流最小割(max flow min cut)
- Max Flow / Min Cut 最大流最小割算法学习
- 最大流最小割定理(max flow/min cut theory)
- 最大流最小割定理(max flow/min cut theory)
- Grab Cut 源码解读(最大流-最小割, min-cut\max-flow)
- 最大流最小割定理(max flow/min cut theory)
- ANDROID样式的开发:DRAWABLE汇总篇
- Python可视化分析-matplot基础
- addGesture 对 UIImageView 不起作用的解决方法
- Redis连接池参数配置
- eclipse汉化
- 洛谷P3128 [USACO15DEC]最大流Max Flow
- 【1701H1】【穆晨】【171022】连续第十二天总结
- 从C++到Java学习笔记
- 安卓调用系统语音识别功能全解(谷歌语音服务):获取识别结果,使用语音识别进行搜索。
- 网络基础概述
- java的语言特性,跨平台原理和两种核心机制(个人总结)
- springmvc-Controller类的方法返回String不跳转
- 714-
- session cookie机制详解