ACM->最大流
Fate_O
Lets go
展开
-
hdu1532Drainage Ditches(最大流)
Drainage DitchesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6743 Accepted Submission(s): 3195Problem DescriptionEvery time it原创 2013-08-15 09:47:59 · 469 阅读 · 0 评论 -
URAL 1736 Chinese Hockey(网络最大流)
一场比赛在规定时间内比完 胜者3分败者0分,加时赛比完胜者2分败者1分然后联赛是单循环赛(任何两只队伍比一次),给出了上赛季每只队伍的积分,问你这个积分合不合理,如果合理则要输出方案。首先我们发现一场比赛的积分固定,然后3分无论怎么分配都能对应一种胜负情况,因此用最大流将每场比赛和每一只队伍分别抽象成点(比赛点: 1 -至2*n*(n-1) 队伍点 2*n*(n-1)+转载 2013-09-20 19:27:01 · 715 阅读 · 0 评论 -
EK算法
#include #include #include #define MAX 302using namespace std;int c[MAX][MAX];int pre[MAX];int visited[MAX];int n, m;bool Path(int src, int des){ queue q; for (int i = 0; i <= m原创 2013-09-21 18:18:55 · 657 阅读 · 0 评论 -
ACM->最大流的dinic递归算法
/*递归dinic*/#include #include #include #include #include #include using namespace std;const int MAXN = 200 + 10;const int INF = 0xfffffff;int n;struct Edge{ int v, w, next;}edge[MAX原创 2013-11-03 20:47:30 · 546 阅读 · 0 评论 -
ACM->最大流 Ombrophobic Bovines
Ombrophobic BovinesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12916 Accepted: 2846DescriptionFJ's cows really hate getting wet so much that the mer原创 2013-11-04 21:36:48 · 461 阅读 · 0 评论