随笔分类 -  算法_网络流

bzoj 1070 费用流
摘要：//可以网络流，但是要怎么分配每辆车让谁维修以及维修顺序呢。可以考虑每辆车维修时间对总结果的贡献，把每个修车人拆成n个点共n*m个点， //n辆车连向这n*m个点，流量1，费用k*修车时间，其中k(1= #include #include #include using namespace std; const int INF=0x7fffffff; const int MAXN=1000; c... 阅读全文
posted @ 2017-09-03 15:35 luckilzy 阅读(316) 评论(0) 推荐(0) 编辑
HDU 3277 最大流+二分
摘要：Marriage Match III Time Limit: 10000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2143 Accepted Submission(s): 阅读全文
posted @ 2017-06-02 16:20 luckilzy 阅读(366) 评论(0) 推荐(0) 编辑
HDU 3081 最大流+二分
摘要：Marriage Match II Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4021 Accepted Submission(s): 13 阅读全文
posted @ 2017-06-01 21:33 luckilzy 阅读(340) 评论(0) 推荐(0) 编辑
HDU 3605 最大流+状态压缩
摘要：Escape Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 9920 Accepted Submission(s): 2372 Problem 阅读全文
posted @ 2017-06-01 15:37 luckilzy 阅读(267) 评论(0) 推荐(0) 编辑
HDU 3572 最大流
摘要：Task Schedule Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8610 Accepted Submission(s): 2636 P 阅读全文
posted @ 2017-06-01 11:30 luckilzy 阅读(304) 评论(0) 推荐(0) 编辑
POJ 2289 最大流
摘要：Jamie's Contact Groups Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 7624 Accepted: 2562 Description Jamie is a very popular girl and has 阅读全文
posted @ 2017-05-25 22:17 luckilzy 阅读(569) 评论(0) 推荐(0) 编辑
POJ 1698 最大流
摘要：Alice's Chance Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 7327 Accepted: 2992 Description Alice, a charming girl, have been dreaming o 阅读全文
posted @ 2017-05-25 15:59 luckilzy 阅读(446) 评论(0) 推荐(0) 编辑
poj 3498 最大流
摘要：March of the Penguins Time Limit: 8000MS Memory Limit: 65536K Total Submissions: 4809 Accepted: 2195 Description Somewhere near the south pole, a numb 阅读全文
posted @ 2017-05-23 22:28 luckilzy 阅读(470) 评论(0) 推荐(0) 编辑
POJ 2112 二分+最大流
摘要：Optimal Milking Time Limit: 2000MS Memory Limit: 30000K Total Submissions: 17297 Accepted: 6203 Case Time Limit: 1000MS Description FJ has moved his K 阅读全文
posted @ 2017-04-20 17:16 luckilzy 阅读(306) 评论(0) 推荐(0) 编辑
POJ 3281 最大流
摘要：Dining Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 17251 Accepted: 7643 Description Cows are such finicky eaters. Each cow has a prefer 阅读全文
posted @ 2017-04-20 15:50 luckilzy 阅读(244) 评论(0) 推荐(0) 编辑
POJ 2391 二分+最大流
摘要：Ombrophobic Bovines Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 19066 Accepted: 4138 Description FJ's cows really hate getting wet so m 阅读全文
posted @ 2017-04-20 14:27 luckilzy 阅读(467) 评论(0) 推荐(0) 编辑
HDU3376 最小费用最大流 模板2
摘要：Matrix Again Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 4255 Accepted Submission(s): 1233 阅读全文
posted @ 2017-03-03 15:24 luckilzy 阅读(302) 评论(0) 推荐(0) 编辑
HDU2686 费用流 模板
摘要：Matrix Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2485 Accepted Submission(s): 1314 Problem 阅读全文
posted @ 2017-03-03 09:03 luckilzy 阅读(268) 评论(0) 推荐(0) 编辑
HDU3251 最大流（最小割）
摘要：Being a Hero Problem Description You are the hero who saved your country. As promised, the king will give you some cities of the country, and you can 阅读全文
posted @ 2017-02-10 14:07 luckilzy 阅读(351) 评论(0) 推荐(0) 编辑
HDU3046 最大流（最小割）
摘要：Pleasant sheep and big big wolf Problem Description In ZJNU, there is a well-known prairie. And it attracts pleasant sheep and his companions to have 阅读全文
posted @ 2017-02-07 17:19 luckilzy 阅读(340) 评论(0) 推荐(0) 编辑
HDU2732 最大流
摘要：Leapin' Lizards Problem Description Your platoon of wandering lizards has entered a strange room in the labyrinth you are exploring. As you are lookin 阅读全文
posted @ 2017-02-07 15:52 luckilzy 阅读(413) 评论(0) 推荐(0) 编辑
HDU1569 最大流（最大点权独立集）
摘要：方格取数(2) Problem Description 给你一个m*n的格子的棋盘，每个格子里面有一个非负数。从中取出若干个数，使得任意的两个数所在的格子没有公共边，就是说所取数所在的2个格子不能相邻，并且取出的数的和最大。 Input 包括多个测试实例，每个测试实例包括2整数m,n和m*n个非负数 阅读全文
posted @ 2017-02-06 22:25 luckilzy 阅读(525) 评论(0) 推荐(0) 编辑
HDU1532最大流 Edmonds-Karp,Dinic算法 模板
摘要：Drainage Ditches Problem Description Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that th 阅读全文
posted @ 2017-02-06 09:59 luckilzy 阅读(1058) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示