Home > OI > 网络流题目集锦

网络流题目集锦


转自http://hi.baidu.com/daizhy_acm/blog/item/c3e63252763ae66984352480.html

最大流
POJ 1273 Drainage Ditches
POJ 1274 The Perfect Stall (二分图匹配)
POJ 1698 Alice’s Chance
POJ 1459 Power Network
POJ 2112 Optimal Milking (二分)
POJ 2455 Secret Milking Machine (二分)
POJ 3189 Steady Cow Assignment (枚举)
POJ 1637 Sightseeing tour (混合图欧拉回路)
POJ 3498 March of the Penguins (枚举汇点)
POJ 1087 A Plug for UNIX
POJ 1149 Pigs (构图题)
ZOJ 2760 How Many Shortest Path (边不相交最短路的条数)
POJ 2391 Ombrophobic Bovines (必须拆点,否则有BUG)
WHU 1124 Football Coach (构图题)
SGU 326 Perspective (构图题,类似于 WHU 1124)
UVa 563 Crimewave
UVa 820 Internet Bandwidth
POJ 3281 Dining (构图题)
POJ 3436 ACM Computer Factory
POJ 2289 Jamie’s Contact Groups (二分)
SGU 438 The Glorious Karlutka River =) (按时间拆点)
SGU 242 Student’s Morning (输出一组解)
SGU 185 Two shortest (Dijkstra 预处理,两次增广,必须用邻接阵实现,否则 MLE)
HOJ 2816 Power Line
POJ 2699 The Maximum Number of Strong Kings (枚举+构图)
ZOJ 2332 Gems
JOJ 2453 Candy (构图题)
SOJ3312 Stockholm Knights
SOJ3353 Total Flow
SOJ2414 Leapin’ Lizards ­
最小割
SOJ3106 Dual Core CPU
SOJ3109 Space flight
SOJ3107 Select
SOJ3185 Black and white
SOJ3254 Rain and Fgj
SOJ3134 windy和水星 — 水星交通
HOJ 2634 How to earn more
ZOJ 2071 Technology Trader (找割边)
HNU 10940 Coconuts
ZOJ 2532 Internship (找关键割边)
POJ 1815 Friendship (字典序最小的点割集)
POJ 3204 Ikki’s Story I – Road Reconstruction (找关键割边)
POJ 3308 Paratroopers
POJ 3084 Panic Room
POJ 3469 Dual Core CPU
ZOJ 2587 Unique Attack (最小割的唯一性判定)
POJ 2125 Destroying The Graph (找割边)
ZOJ 2539 Energy Minimization
TJU 2944 Mussy Paper (最大权闭合子图)
POJ 1966 Cable TV Network (无向图点连通度)
HDU 1565 方格取数(1) (最大点权独立集)
HDU 1569 方格取数(2) (最大点权独立集)
POJ 2987 Firing (最大权闭合子图)
SPOJ 839 Optimal Marks (将异或操作转化为对每一位求最小割)
HOJ 2811 Earthquake Damage (最小点割集)
2008 Beijing Regional Contest Problem A Destroying the bus stations ( BFS 预处理 )(http://acmicpc-live-archive.uva.es/nuevoportal/data/problem.php?p=4322)
ZOJ 2676 Network Wars (参数搜索)
POJ 3155 Hard Life (参数搜索)
ZOJ 3241 Being a Hero

有上下界
ZOJ 2314 Reactor Cooling (无源汇可行流)
POJ 2396 Budget (有源汇可行流)
SGU 176 Flow Construction (有源汇最小流)
ZOJ 3229 Shoot the Bullet (有源汇最大流)
HDU 3157 Crazy Circuits (有源汇最小流)

最小费用流
HOJ 2715 Matrix3
HOJ 2739 The Chinese Postman Problem
POJ 2175 Evacuation Plan (消一次负圈)
POJ 3422 Kaka’s Matrix Travels (与 Matrix3 类似)
POJ 2516 Minimum Cost (按物品种类多次建图)
POJ 2195 Going Home
BUAA 1032 Destroying a Painting
POJ 2400 Supervisor, Supervisee (输出所有最小权匹配)
POJ 3680 Intervals
HOJ 2543 Stone IV
POJ 2135 Farm Tour
BASHU2445 餐巾问题
———————————————onmylove原创

最大流题目:

TC:

Single Round Match 200 Round 1 – Division I, Level Three

Single Round Match 236 Round 1 – Division I, Level Three

Single Round Match 399 Round 1 – Division I, Level Three

同Hoj1024: http://acm.hust.edu.cn/thx/problem.php?id=1024

2003 TCO Semifinal Round 4 – Division I, Level Three

2004 TCCC Championship Round – Division I, Level Three

2005 TCO Sponsor Track Round 3 – Division I, Level One

混合图的欧拉回路

Poj1637: http://acm.pku.edu.cn/JudgeOnline/problem?id=1637

zju1992:http://acm.zju.edu.cn/show_problem.php?pid=1992

求增广边:

Poj3204:http://acm.pku.edu.cn/JudgeOnline/problem?id=3204

类似:Hoj1082: http://acm.hust.edu.cn/thx/problem.php?cid=1017&pid=6

项目选择问题:

Poj3469:http://acm.pku.edu.cn/JudgeOnline/problem?id=3469

Zoj2930:http://acm.zju.edu.cn/show_problem.php?pid=2930

求项目选择项目最多的方案。

建图:

Poj1149:http://acm.pku.edu.cn/JudgeOnline/problem?id=1149

Poj3436:http://acm.pku.edu.cn/JudgeOnline/problem?id=3436

Poj3281:http://acm.pku.edu.cn/JudgeOnline/problem?id=3281

连通度:

点连通度Poj1966: http://acm.pku.edu.cn/JudgeOnline/problem?id=1966

Uva563, http://icpcres.ecs.baylor.edu/onlinejudge/

点不交的路径条数问题,需要拆点

最小割:

Poj2914:http://acm.pku.edu.cn/JudgeOnline/problem?id=2914

(stoer-Wagner)

基本题:

Poj3498:http://acm.pku.edu.cn/JudgeOnline/problem?id=3498

枚举:做n次最大流。

Poj1087:http://acm.pku.edu.cn/JudgeOnline/problem?id=1087

可以用最大流做,也可以用二分图匹配做。

Poj1273:http://acm.pku.edu.cn/JudgeOnline/problem?id=1273

Poj1274:http://acm.pku.edu.cn/JudgeOnline/problem?id=1274

Poj1325: http://acm.pku.edu.cn/JudgeOnline/problem?id=1325

poj1459:http://acm.pku.edu.cn/JudgeOnline/problem?id=1459

Poj1797:http://acm.pku.edu.cn/JudgeOnline/problem?id=1797

Poj1815:http://acm.pku.edu.cn/JudgeOnline/problem?id=1815

poj2112:http://acm.pku.edu.cn/JudgeOnline/problem?id=2112

poj2239:http://acm.pku.edu.cn/JudgeOnline/problem?id=2239

poj2289: http://acm.pku.edu.cn/JudgeOnline/problem?id=2289

Poj2391:http://acm.pku.edu.cn/JudgeOnline/problem?id=2391

Poj2987:http://acm.pku.edu.cn/JudgeOnline/problem?id=2987

Poj3308:http://acm.pku.edu.cn/JudgeOnline/problem?id=3308

提示:最大权闭包,转化成最大流

Poj3155: http://acm.pku.edu.cn/JudgeOnline/problem?id=3155

SGU 176 http://acm.sgu.ru/problem.php?contest=0&problem=176

容量有上下界的网络流问题,有难度

Spoj660:http://www.spoj.pl/problems/QUEST4/

Spoj377:http://www.spoj.pl/problems/TAXI/

UVA

http://icpcres.ecs.baylor.edu/onlinejudge/

753,

820,

10122,

10330,

10511,

10735.

Categories: OI Tags:
  1. No comments yet.
  1. No trackbacks yet.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: