ACM_网络流
文章平均质量分 88
zhj5chengfeng
这个作者很懒,什么都没留下…
展开
-
最大权闭合图
闭合图:图中所有顶点的出边所指向的顶点仍然在改闭合图中,称改图为闭合图 最大权闭合图:给图中每个顶点一个权值(有正有负),闭合图的权值为闭合图中所有点的权值之和,最大权闭合图就是一个图的所有闭合图中权值大的闭合图 解法:网络流。具体请详见:胡伯涛:《最小割模型在信息学竞赛中的应用》 建图: 1、新增原创 2012-09-05 09:44:48 · 748 阅读 · 0 评论 -
SPOJ 839 Optimal Marks
839. Optimal MarksProblem code: OPTMYou are given an undirected graph G(V, E). Each vertex has a mark which is an integer from the range [0..231 – 1]. Different vertexes may ha原创 2012-09-18 14:31:45 · 850 阅读 · 0 评论 -
HDU 1533 Going Home
Going HomeTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1799 Accepted Submission(s): 871Problem DescriptionOn a grid map there a原创 2012-09-17 23:02:07 · 435 阅读 · 0 评论 -
HDU 3061 Battle
BattleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 628 Accepted Submission(s): 304Problem Description由于小白同学近期习武十分刻苦,很快被晋升为天策军的原创 2012-09-17 22:58:06 · 347 阅读 · 0 评论 -
HDU 3879 Base Station
Base StationTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 65768/32768 K (Java/Others)Total Submission(s): 1176 Accepted Submission(s): 506Problem DescriptionA famous mobile co原创 2012-09-17 22:55:20 · 403 阅读 · 0 评论 -
HDU 4289 Control
ControlTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 356 Accepted Submission(s): 191Problem Description You, the head of Depar原创 2012-09-17 22:46:56 · 411 阅读 · 0 评论 -
HDU 1569 方格取数(2)
方格取数(2)Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2878 Accepted Submission(s): 871Problem Description给你一个m*n的格子的棋盘,每个格子里面有一原创 2012-09-17 23:07:15 · 578 阅读 · 0 评论 -
HDU 2686 Matrix
MatrixTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 904 Accepted Submission(s): 508Problem DescriptionYifenfei very like play a原创 2012-09-17 23:05:12 · 515 阅读 · 0 评论 -
HDU 4280 Island Transport
Island TransportTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2042 Accepted Submission(s): 636Problem Description In the vast原创 2012-09-17 22:52:30 · 554 阅读 · 0 评论 -
HDU 1532 Drainage Ditches
Drainage DitchesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4748 Accepted Submission(s): 2210Problem DescriptionEvery time it原创 2012-09-17 23:00:02 · 369 阅读 · 0 评论 -
HDU 4279 Food
FoodTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 475 Accepted Submission(s): 222Problem Description You, a part-time dining ser原创 2012-09-17 22:49:38 · 466 阅读 · 0 评论 -
HDU 3657 Game
GameTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 575 Accepted Submission(s): 242Problem Descriptiononmylove has invented a game原创 2012-09-17 23:11:55 · 427 阅读 · 0 评论 -
HDU 1565 方格取数(1)
方格取数(1)Time Limit: 1000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2410 Accepted Submission(s): 919Problem Description给你一个n*n的格子的棋盘,每个格子里面有一个非负原创 2012-09-17 23:09:40 · 475 阅读 · 0 评论 -
POJ 1149 PIGS
题目传送门:POJ 1149 PIGS 题目大意是说有 m 个猪圈,每个猪圈中有一定数量的猪。有 n 个人,分别在不同的日子里来买猪,每个人买猪的时候指定买哪些猪圈中的猪,在卖猪这天,主人可以随意的调整猪圈中的猪的数量,然后关上猪圈,等待下一个买猪的人到来,每个顾客分别有个买猪数量的上限。问主人通过合理的安排之后,最多能卖多少猪? 网络流,建图方法:原创 2012-10-05 20:15:54 · 456 阅读 · 0 评论 -
二分图的最大点权独立集和最小点权覆盖集
一个定理:二分图的最小点权覆盖集对应最大点权独立集 最小点权覆盖集的建图方法: 1、增加源点 s,连接 s 到 x 集合中所有点,边权是相应点的点权 2、增加汇点 t,连接 y 集合中所有点到 t,边权是相应点的点权 3、对原图中的边,将边权变成无穷大原创 2012-09-08 18:13:50 · 1894 阅读 · 0 评论 -
HDU 3996 Gold Mine
Gold MineTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1361 Accepted Submission(s): 312Problem DescriptionLong long ago, there原创 2012-09-18 14:31:13 · 615 阅读 · 0 评论