
网络流
文章平均质量分 83
zqdnr
唯论成败,只求最强
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
POJ 2125 网络流-最小点权覆盖
Destroying The GraphTime Limit: 2000MS Memory Limit: 65536K Total Submissions: 7457 Accepted: 2373 Special JudgeDescriptionAlice and Bob play the following game. First, Alice draws some原创 2015-04-05 23:36:40 · 528 阅读 · 0 评论 -
POJ 3469 最小割经典模型
Dual Core CPUTime Limit: 15000MS Memory Limit: 131072K Total Submissions: 20038 Accepted: 8696 Case Time Limit: 5000MSDescriptionAs more and more computers are equipped with dual core CPU,原创 2015-04-05 23:47:54 · 408 阅读 · 0 评论 -
COGS 426 血帆海盗 最小割+强连通分量
血帆海盗问题描述随着资本的扩大,藏宝海湾贸易亲王在卡利姆多和东部王国大陆各建立了 N/2 个港口。大灾变发生以后,这些港口之间失去了联系,相继脱离了藏宝海湾贸易亲王的管辖,各自为政。 利益的驱动使得每个港口都想和对岸大陆的另一个港口建立贸易合作关系,由于地理位置因素,只有存在直接到达的航线的两个港口才能建立合作,而且每个港口只与对岸一个港口建立合作,因此并不是所有的港口都能找到合作伙伴。原创 2015-04-03 16:30:04 · 873 阅读 · 0 评论 -
POJ 2396 有上下界有源汇可行流
BudgetTime Limit: 3000MS Memory Limit: 65536K Total Submissions: 6282 Accepted: 2387 Special JudgeDescriptionWe are supposed to make a budget proposal for this multi-site competition. Th原创 2015-04-24 22:50:08 · 480 阅读 · 0 评论 -
SGU 176 有源汇有上下界最小流(模板)
176. Flow constructiontime limit per test: 0.5 sec. memory limit per test: 4096 KB input: standard output: standardYou have given the net consisting of nodes and pipes; pipes connect the nodes. Some原创 2015-04-23 21:52:37 · 455 阅读 · 0 评论 -
HUST 1342 有上下界最小流
Cheat SecretlyDescriptionHH Big Cow(HBC) has taken part in an interesting treasure finding match. In the match there are N transmitting nodes(labeled from 1 to N), and between these nodes there are M d原创 2015-04-25 19:30:51 · 550 阅读 · 0 评论