[USACO15DEC]最大流Max Flow

原创 2017年08月21日 20:10:45

 

题目描述

Farmer John has installed a new system of N-1N1 pipes to transport milk between the NN stalls in his barn (2 \leq N \leq 50,0002N50,000), conveniently numbered 1 \ldots N1N. 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,0001K100,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 KKpaths 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-1N1 lines each contain two integers xx and yy (x \ne yxy) 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.

输入输出样例

输入样例#1:
5 10
3 4
1 5
4 2
5 4
5 4
5 4
3 5
4 3
4 3
1 3
3 5
5 4
1 5
3 4
输出样例#1:
9


























    一道树上差分的裸题,也是因为要做交通运输,所以来看看树上差分的知识,于是便找上了这题,题目描述很简单,就是给你一棵树以及几个操作,这些操作包含两个点,具体内容就是让你把这两个点之间的路径上所有的点点权加一,最后输出点权最大值。

    既然是求树上的两点之间路径,很容易想到LCA,tarjan(N+K)的复杂度足以胜任,接下来便是玄学的推导,到最后你会发现,其实对于读入两个点{u,v},我们要进行的只是tree[u]++,tree[v]++,tree[lca(u,v)]--,tree[father[lca(u,v)]]--;其中tree[]表示每个点的点权,到最后统计的时候再加上这个点所有子节点的点权即是它的最终点权

贴上一段代码,看不懂的地方在评论区里戳我。。

#include
#include
#include
#define N 50010
#define K 100010
using namespace std;
struct node1{
	int v;
};
struct node2{
	int v,id;
};
vector  pic[N];
vector  edge[N];
int vis[N],f[N],up[N],ans[K],tree[N],n,k,ANS;
int find(int x){
	if (f[x]==x) return x;
	return f[x]=find(f[x]);
}
void tarjan(int u){
	int i;
	vis[u]=1;f[u]=u;
	for (i=0;iANS) ANS=tree[u];
}
int main(){
	int i;
	scanf("%d%d",&n,&k);
	for (i=1;i


最小割与最大流(mincut & maxflow)

这里先介绍mincut和maxflow,为介绍Grabcut打下基础。Grabcut可以用在图像分割和文字二值化中。 1首先介绍Mincut问题。这部分内容主要翻译自[1],可以看原版理解的更深.由于...
  • PeaceInMind
  • PeaceInMind
  • 2015-11-30 19:33:35
  • 5151

P3128 [USACO15DEC]最大流Max Flow

Farmer John has installed a new system of N-1N−1 pipes to transport milk between the NN stalls i...
  • Misfit2001
  • Misfit2001
  • 2017-10-25 09:25:28
  • 104

[USACO15DEC]最大流Max Flow题解

USACOMax Flow题解
  • mk703
  • mk703
  • 2017-03-01 18:48:58
  • 140

CV | Max Flow / Min Cut 最大流最小割算法学习

最大流/最小割(Max-Flow/Min-Cut)算法,因其可以对能量方程最小化进行求解,在计算机视觉(CV)中有很广泛的应用。之前介绍过的Seam Carving算法(用于图像智能缩放),或是图像分...
  • iLOVEJohnny
  • iLOVEJohnny
  • 2016-07-24 22:21:17
  • 4590

洛谷 P3128 [USACO15DEC] 最大流Max Flow

lca+树上差分
  • SenyeLicone
  • SenyeLicone
  • 2017-03-16 08:55:35
  • 322

洛谷P3128 [USACO15DEC]最大流Max Flow

link-cut-tree
  • FSAHFGSADHSAKNDAS
  • FSAHFGSADHSAKNDAS
  • 2017-03-08 15:12:19
  • 298

洛谷 P3128 [USACO15DEC]最大流Max Flow

树上差分
  • Rlt1296
  • Rlt1296
  • 2016-11-27 21:31:05
  • 290

最大流-EK算法

示例题目: HDU3549#include #include #include #include #include #include using namespace std; const int MA...
  • algzjh
  • algzjh
  • 2017-08-14 15:40:33
  • 188

[图论]最大流问题(Maximum flow)的定义

首先定义网络(network)N =(V,E), V表示顶点(Vertices)集合, E表示边(Edges)集合。s,t是V中的两个顶点,分别表示网络N中的源点(source)和汇点(sink)。容...
  • bendanban
  • bendanban
  • 2014-12-12 13:39:44
  • 3601
收藏助手
不良信息举报
您举报文章:[USACO15DEC]最大流Max Flow
举报原因:
原因补充:

(最多只允许输入30个字)