【网络流】
riba2534
没有谁生来就是神牛,而千里之行,始于足下!
展开
-
UVA10480 Sabotage (网络流,最小割,ISAP算法,最大流最小割定理)
描述 The regime of a small but wealthy dictatorship has been abruptly overthrown by an unexpected rebellion. Because of the enormous disturbances this is causing in world economy, an imperiali原创 2018-01-10 23:19:53 · 415 阅读 · 0 评论 -
HDU4280 Island Transport(网络流,最大流,SAP算法,gap优化)
Problem Description In the vast waters far far away, there are many islands. People are living on the islands, and all the transport among the islands relies on the ships. You have a tran原创 2018-01-10 10:56:28 · 333 阅读 · 0 评论 -
NYOJ61 传纸条(一)(最大费用最大流解法)
描述 小渊和小轩是好朋友也是同班同学,他们在一起总有谈不完的话题。一次素质拓展活动中,班上同学安排做成一个m行n列的矩阵,而小渊和小轩被安排在矩阵对角线的两端,因此,他们就无法直接交谈了。幸运的是,他们可以通过传纸条来进行交流。纸条要经由许多同学传到对方手里,小渊坐在矩阵的左上角,坐标(1,1),小轩坐在矩阵的右下角,坐标(m,n)。从小渊传到小轩的纸条只可以向下或者向右传递,从小轩传给小原创 2018-01-18 12:02:53 · 436 阅读 · 0 评论 -
POJ2516 Minimum Cost(网络流,最小费用最大流)
escription Dearboy, a goods victualer, now comes to a big problem, and he needs your help. In his sale area there are N shopkeepers (marked from 1 to N) which stocks goods from him.Dearboy h原创 2018-01-09 17:03:12 · 338 阅读 · 0 评论 -
HDU4292 Food (网络流,最大流,Dinic算法)
描述 You, a part-time dining service worker in your college’s dining hall, are now confused with a new problem: serve as many people as possible. The issue comes up as people in your college原创 2018-01-09 13:45:11 · 412 阅读 · 0 评论 -
洛谷-P3381 【模板】最小费用最大流(最小费用路算法)
题目描述 如题,给出一个网络图,以及其源点和汇点,每条边已知其最大流量和单位流量费用,求出其网络最大流和在最大流情况下的最小费用。输入格式: 第一行包含四个正整数N、M、S、T,分别表示点的个数、有向边的个数、源点序号、汇点序号。 接下来M行每行包含四个正整数ui、vi、wi、fi,表示第i条有向边从ui出发,到达vi,边权为wi(即该边最大流量为wi),单位流量的原创 2018-01-09 11:23:10 · 976 阅读 · 0 评论 -
POJ2195 Going Home(网络流,最小费用流,最小费用路算法)
Description On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to an adjacent point. For each原创 2018-01-09 11:09:58 · 360 阅读 · 0 评论 -
POJ1087 A Plug for UNIX(网络流,最大流,EK算法)
Description You are in charge of setting up the press room for the inaugural meeting of the United Nations Internet eXecutive (UNIX), which has an international mandate to make the free flow原创 2018-01-08 16:12:33 · 341 阅读 · 0 评论 -
POJ3281 Dining(拆点,最大流,EK算法)
Description Cows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others. Farmer John has cooked fabulous meals for his cows, but he原创 2018-01-08 10:20:06 · 433 阅读 · 0 评论 -
POJ3436 ACM Computer Factory(多源点网络流,拆点,EK算法)
Description As you know, all the computers used for ACM contests must be identical, so the participants compete on equal terms. That is why all these computers are historically produced at t原创 2018-01-07 20:23:00 · 390 阅读 · 0 评论 -
POJ1273 Drainage Ditches(网络流--最大流,EK增广路算法)
Description Every time it rains on Farmer John’s fields, a pond forms over Bessie’s favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long ti原创 2017-12-29 17:17:20 · 597 阅读 · 0 评论 -
POJ1459 Power Network(多源点网络流,最大流,EK算法)
Description A power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 of power, may pro原创 2017-12-30 13:43:15 · 526 阅读 · 0 评论 -
HDU3416 Marriage Match IV(最短路,网络流,最大流,SPFA,ISAP算法)
Problem Description Do not sincere non-interference。 Like that show, now starvae also take part in a show, but it take place between city A and B. Starvae is in city A and girls are in city原创 2018-01-12 16:49:10 · 415 阅读 · 1 评论 -
网络流相关算法总结,最大流EK算法,SAP算法,最小费用最大流,最小费用路算法,最大流最小割定理
网络流相关定义网络是一个有向带权图,包含一个源点和一个汇点,没反平行边网络流:即网络上的流,是定义在边集E上的一个非负函数flow={flow(u,v)}flow=\{flow(u,v)\},flow(u,v)flow(u,v)是边上的流量可行流:满足容量约束和流量守恒的网络流网络最大流:满足容量约束和流量守恒的条件下,在流网络中找到一个净输出最大的网络流最大流求解最大流原创 2018-01-10 12:08:06 · 1268 阅读 · 1 评论 -
HDU3081 Marriage Match II(网络流,最大流,二分,并查集,传递闭包,ISAP)
Problem Description Presumably, you all have known the question of stable marriage match. A girl will choose a boy; it is similar as the game of playing house we used to play when we are kid原创 2018-01-12 11:17:08 · 332 阅读 · 0 评论 -
HDU3605 Escape(网络流,最大流,状态压缩,ISAP算法)
Problem Description 2012 If this is the end of the world how to do? I do not know how. But now scientists have found that some stars, who can live, but some people do not fit to live some of原创 2018-01-11 21:32:58 · 404 阅读 · 0 评论 -
HDU4289 Control(网络流,最大流,拆点,ISAP算法)
Problem Description You, the head of Department of Security, recently received a top-secret information that a group of terrorists is planning to transport some WMD 1 from one city (the sou原创 2018-01-10 19:28:42 · 333 阅读 · 0 评论