网络流
文章平均质量分 87
相思作坊半世离殇
多刷题。
展开
-
网络流相关算法模板
模板均来自《挑战程序设计竞赛》3.最小费用流1.代码1时间复杂度为O(F|V||E|)(F是流量)#define INF 0x7fffffff//最小费用流模板#define MAX_V 1005//用于表示边的结构体(终点,容量,费用反向边)struct edge{ int to,cap,cost,rev;};int V;//顶点数vector G[M原创 2016-09-23 23:55:32 · 307 阅读 · 0 评论 -
Dining POJ3281 最大流
1.题目原文http://poj.org/problem?id=3281Language:DefaultDiningTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 15462 Accepted: 7012Descript原创 2016-09-24 01:53:46 · 266 阅读 · 0 评论 -
Stock Charts(Google Code Jam 2009 Round2 C)二分图最大匹配
来自《挑战程序设计竞赛》1.题目原文https://code.google.com/codejam/contest/204113/dashboard#s=p2You're in the middle of writing your newspaper's end-of-year economics summary, and you've decided that you wan原创 2016-09-27 23:17:02 · 826 阅读 · 0 评论 -
No Cheating(Google Code Jam 2008 Round 3C)二分图最大独立集
来自《挑战程序设计竞赛》1.题目原文https://code.google.com/codejam/contest/32002/dashboard#s=p2ProblemA local high school is going to hold a final exam in a big classroom. However, some students in this sc原创 2016-09-25 00:34:58 · 677 阅读 · 0 评论 -
Asteroids POJ3041 二分图最小顶点覆盖
1.题目原文http://poj.org/problem?id=3041AsteroidsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 20663 Accepted: 11224DescriptionBessie wants to n原创 2016-09-24 00:32:06 · 376 阅读 · 0 评论 -
1393-二分图多重匹配问题
具体见https://hihocoder.com/problemset/problem/1393原题给的提示是利用网络流的方法解决。具体可以见提示。。(懒得写)贴出AC代码。#include #include #include #include #include #include using namespace std;const int maxn =100+10;#原创 2016-12-21 02:01:04 · 490 阅读 · 0 评论