网络流题目集锦(by 戴神)
2014-03-08 17:32
351 查看
转载自daizhy_acm
最大流
POJ1273DrainageDitches
POJ1274ThePerfectStall(二分图匹配)
POJ1698Alice'sChance
POJ1459PowerNetwork
POJ2112OptimalMilking(二分)
POJ2455SecretMilkingMachine(二分)
POJ3189SteadyCowAssignment(枚举)
POJ1637Sightseeingtour(混合图欧拉回路)
POJ3498MarchofthePenguins(枚举汇点)
POJ1087APlugforUNIX
POJ1149Pigs(构图题)
ZOJ2760HowManyShortestPath(边不相交最短路的条数)
POJ2391OmbrophobicBovines(必须拆点,否则有BUG)
WHU1124FootballCoach(构图题)
SGU326Perspective(构图题,类似于WHU1124)
UVa563Crimewave
UVa820InternetBandwidth
POJ3281Dining(构图题)
POJ3436ACMComputerFactory
POJ2289Jamie'sContactGroups(二分)
SGU438TheGloriousKarlutkaRiver=)(按时间拆点)
SGU242Student'sMorning(输出一组解)
SGU185Twoshortest(Dijkstra预处理,两次增广,必须用邻接阵实现,否则MLE)
HOJ2816PowerLine
POJ2699TheMaximumNumberofStrongKings(枚举+构图)
ZOJ2332Gems
JOJ2453Candy(构图题)
SOJ3312StockholmKnights
SOJ3353TotalFlow
SOJ2414Leapin'Lizards
最小割
SOJ3106DualCoreCPU
SOJ3109Spaceflight
SOJ3107Select
SOJ3185Blackandwhite
SOJ3254RainandFgj
SOJ3134windy和水星--水星交通
HOJ2634Howtoearnmore
ZOJ2071TechnologyTrader(找割边)
HNU10940Coconuts
ZOJ2532Internship(找关键割边)
POJ1815Friendship(字典序最小的点割集)
POJ3204Ikki'sStoryI-RoadReconstruction(找关键割边)
POJ3308Paratroopers
POJ3084PanicRoom
POJ3469DualCoreCPU
ZOJ2587UniqueAttack(最小割的唯一性判定)
POJ2125DestroyingTheGraph(找割边)
ZOJ2539EnergyMinimization
TJU2944MussyPaper(最大权闭合子图)
POJ1966CableTVNetwork(无向图点连通度)
HDU1565方格取数(1)(最大点权独立集)
HDU1569方格取数(2)(最大点权独立集)
POJ2987Firing(最大权闭合子图)
SPOJ839OptimalMarks(将异或操作转化为对每一位求最小割)
HOJ2811EarthquakeDamage(最小点割集)
2008BeijingRegionalContestProblemADestroyingthebusstations(BFS预处理)
(http://acmicpc-live-archive.uva.es/nuevoportal/data/problem.php?p=4322)
ZOJ2676NetworkWars(参数搜索)
POJ3155HardLife(参数搜索)
ZOJ3241BeingaHero
有上下界
ZOJ2314ReactorCooling(无源汇可行流)
POJ2396Budget(有源汇可行流)
SGU176FlowConstruction(有源汇最小流)
ZOJ3229ShoottheBullet(有源汇最大流)
HDU3157CrazyCircuits(有源汇最小流)
最小费用流
HOJ2715Matrix3
HOJ2739TheChinesePostmanProblem
POJ2175EvacuationPlan(消一次负圈)
POJ3422Kaka'sMatrixTravels(与Matrix3类似)
POJ2516MinimumCost(按物品种类多次建图)
POJ2195GoingHome
BUAA1032DestroyingaPainting
POJ2400Supervisor,Supervisee(输出所有最小权匹配)
POJ3680Intervals
HOJ2543StoneIV
POJ2135FarmTour
最大流题目:
TC:
SingleRoundMatch200Round
1–DivisionI,LevelThree
SingleRoundMatch236Round
1–DivisionI,LevelThree
SingleRoundMatch399Round1–DivisionI,LevelThree
同Hoj1024:http://acm.hust.edu.cn/thx/problem.php?id=1024
2003TCOSemifinalRound4–DivisionI,LevelThree
2004TCCCChampionshipRound
–DivisionI,LevelThree
2005TCOSponsorTrackRound
3–DivisionI,LevelOne
混合图的欧拉回路
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
难
SGU176http://acm.sgu.ru/problem.php?contest=0&problem=176
容量有上下界的网络流问题,有难度
Spoj660:http://www.spoj.pl/problems/QUEST4/
Spoj377:http://www.spoj.pl/problems/TAXI/
UVAhttp://icpcres.ecs.baylor.edu/onlinejudge/
753,820,10122,10330,10511,10735.
最大流
POJ1273DrainageDitches
POJ1274ThePerfectStall(二分图匹配)
POJ1698Alice'sChance
POJ1459PowerNetwork
POJ2112OptimalMilking(二分)
POJ2455SecretMilkingMachine(二分)
POJ3189SteadyCowAssignment(枚举)
POJ1637Sightseeingtour(混合图欧拉回路)
POJ3498MarchofthePenguins(枚举汇点)
POJ1087APlugforUNIX
POJ1149Pigs(构图题)
ZOJ2760HowManyShortestPath(边不相交最短路的条数)
POJ2391OmbrophobicBovines(必须拆点,否则有BUG)
WHU1124FootballCoach(构图题)
SGU326Perspective(构图题,类似于WHU1124)
UVa563Crimewave
UVa820InternetBandwidth
POJ3281Dining(构图题)
POJ3436ACMComputerFactory
POJ2289Jamie'sContactGroups(二分)
SGU438TheGloriousKarlutkaRiver=)(按时间拆点)
SGU242Student'sMorning(输出一组解)
SGU185Twoshortest(Dijkstra预处理,两次增广,必须用邻接阵实现,否则MLE)
HOJ2816PowerLine
POJ2699TheMaximumNumberofStrongKings(枚举+构图)
ZOJ2332Gems
JOJ2453Candy(构图题)
SOJ3312StockholmKnights
SOJ3353TotalFlow
SOJ2414Leapin'Lizards
最小割
SOJ3106DualCoreCPU
SOJ3109Spaceflight
SOJ3107Select
SOJ3185Blackandwhite
SOJ3254RainandFgj
SOJ3134windy和水星--水星交通
HOJ2634Howtoearnmore
ZOJ2071TechnologyTrader(找割边)
HNU10940Coconuts
ZOJ2532Internship(找关键割边)
POJ1815Friendship(字典序最小的点割集)
POJ3204Ikki'sStoryI-RoadReconstruction(找关键割边)
POJ3308Paratroopers
POJ3084PanicRoom
POJ3469DualCoreCPU
ZOJ2587UniqueAttack(最小割的唯一性判定)
POJ2125DestroyingTheGraph(找割边)
ZOJ2539EnergyMinimization
TJU2944MussyPaper(最大权闭合子图)
POJ1966CableTVNetwork(无向图点连通度)
HDU1565方格取数(1)(最大点权独立集)
HDU1569方格取数(2)(最大点权独立集)
POJ2987Firing(最大权闭合子图)
SPOJ839OptimalMarks(将异或操作转化为对每一位求最小割)
HOJ2811EarthquakeDamage(最小点割集)
2008BeijingRegionalContestProblemADestroyingthebusstations(BFS预处理)
(
ZOJ2676NetworkWars(参数搜索)
POJ3155HardLife(参数搜索)
ZOJ3241BeingaHero
有上下界
ZOJ2314ReactorCooling(无源汇可行流)
POJ2396Budget(有源汇可行流)
SGU176FlowConstruction(有源汇最小流)
ZOJ3229ShoottheBullet(有源汇最大流)
HDU3157CrazyCircuits(有源汇最小流)
最小费用流
HOJ2715Matrix3
HOJ2739TheChinesePostmanProblem
POJ2175EvacuationPlan(消一次负圈)
POJ3422Kaka'sMatrixTravels(与Matrix3类似)
POJ2516MinimumCost(按物品种类多次建图)
POJ2195GoingHome
BUAA1032DestroyingaPainting
POJ2400Supervisor,Supervisee(输出所有最小权匹配)
POJ3680Intervals
HOJ2543StoneIV
POJ2135FarmTour
最大流题目:
TC:
SingleRoundMatch200Round
1–DivisionI,LevelThree
SingleRoundMatch236Round
1–DivisionI,LevelThree
同Hoj1024:
2004TCCCChampionshipRound
–DivisionI,LevelThree
2005TCOSponsorTrackRound
3–DivisionI,LevelOne
混合图的欧拉回路
Poj1637:
zju1992:
求增广边:
Poj3204:
类似:Hoj1082:
项目选择问题:
Poj3469:
Zoj2930:
求项目选择项目最多的方案。
建图:
Poj1149:
Poj3436:
Poj3281:
连通度:
点连通度Poj1966:
Uva563,
点不交的路径条数问题,需要拆点
最小割:
Poj2914:
基本题:
Poj3498:
枚举:做n次最大流。
Poj1087:
可以用最大流做,也可以用二分图匹配做。
Poj1273:
Poj1274:
Poj1325:
Poj1459:
Poj1797:
Poj1815:
Poj2112:
Poj2239:
Poj2289:
Poj2391:
Poj2987:
Poj3308:
提示:
Poj3155:
难
SGU176
容量有上下界的网络流问题,有难度
Spoj660:
Spoj377:
UVA
753,820,10122,10330,10511,10735.