排序:
默认
按更新时间
按访问量

2017 ACM/ICPC Asia Regional Qingdao Online HDU 6214 Smallest Minimum Cut(最小割的边数)

Smallest Minimum Cut Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 234 Accepted Submis...

2017-09-17 19:21:35

阅读数:695

评论数:0

BZOJ 1001 狼抓兔子 (最大流)

这里是传送门 1001: [BeiJing2006]狼抓兔子 Time Limit: 15 Sec  Memory Limit: 162 MB Submit: 24044  Solved: 6079 [Submit][Status][Discuss] Description 现在小朋友们最喜...

2017-09-05 16:07:46

阅读数:386

评论数:0

POJ 3281 Dining(拆点+最大流)

Dining Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 19123 Accepted: 8534 Description Cows are such finicky eaters. Each cow has a pr...

2017-08-21 16:31:45

阅读数:407

评论数:0

HDU 2732 Leapin' Lizards(拆点+最大流)

Leapin' Lizards Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3015 Accepted Submission...

2017-08-20 18:16:03

阅读数:509

评论数:0

HDU 4289 Control(最大流+拆点)

Control Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3561 Accepted Submission(s): 149...

2017-08-18 08:25:34

阅读数:449

评论数:0

UVA 10480 Sabotage (最大流)

Sabotage The regime of a small but wealthy dictatorship has been abruptly overthrown by an unexpected rebellion. Because of the enormous disturbance...

2017-08-17 15:48:55

阅读数:536

评论数:0

网络流总结(持续更新中)

什么是网络流 1.我自己理解的网络流 我对网络流的理解就是,给定一个有向图,这个有向图有一种特点,都可以看成从某个点开始,我们称之为源点,一般情况下都将此点定位第一个点,即初始点,所有的点最终都会在一个点会和,我们称之为汇点,通常将此点定位为n,也就是最后一个点。既然是网络流,那么一定不会很简单,...

2017-08-02 20:31:50

阅读数:423

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭