# HDU 3394 Railway (点双联通分量+桥)

Problem Description There are some locations in a park, and some of them are connected by roads. The park manger needs to build some railways along...

# POJ 1459 Power Network (最大流)

Description A power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be suppl...

# POJ 1273:Drainage Ditches (最大流)

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...

# POJ 3469：Dual Core CPU （最大流）

Description As more and more computers are equipped with dual core CPU, SetagLilb, the Chief Technology Officer of TinySoft Corporation, decided to...

# HDU 3549 Flow Problem （最大流）

Problem Description Network flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the wei...

# HDU 3376 Matrix Again （最小费用最大流）

Problem Description Starvae very like play a number game in the n*n Matrix. A positive integer number is put in each area of the Matrix. Every...

# POJ 2135 Farm Tour （最小费用流）

Description When FJ’s friends visit him on the farm, he likes to show them around. His farm comprises N (1 <= N <= 1000) fields numbered 1..N...

# HDU 1269：迷宫城堡 （Tarjan强连通分量）

Problem Description 为了训练小希的方向感，Gardon建立了一座大城堡，里面有N个房间(N<=10000)和M条通道(M<=100000)，每个通道都是单向的，就是说若称某通道连通了A房间和B房间，只说明可以通过这个通道由A房间到达B房间，但并不说明通过它可以由...

个人资料
等级：
访问量： 36万+
积分： 1万+
排名： 2019
欢迎关注 <千与梦随> 哦！
博客专栏
 那些年,我们一起追过的算法 文章：6篇 阅读：23920
最新评论