随笔分类 -  图论-网络流

摘要:Description On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or ver 阅读全文
posted @ 2017-05-02 20:37 Robin! 阅读(255) 评论(0) 推荐(0) 编辑
摘要:Introduction You are the lead programmer for the Securitron 9042, the latest and greatest in home security software from Jellern Inc. (Motto: We secur 阅读全文
posted @ 2017-04-24 20:31 Robin! 阅读(216) 评论(0) 推荐(0) 编辑
摘要:Problem You are in charge of setting up the press room for the inaugural meeting of the United Nations Internet eXecutive (UNIX), which has an interna 阅读全文
posted @ 2017-04-20 21:55 Robin! 阅读(158) 评论(0) 推荐(0) 编辑
摘要:Description Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by wa 阅读全文
posted @ 2017-04-20 19:59 Robin! 阅读(155) 评论(0) 推荐(0) 编辑
摘要:Description 每当西瓜的朋友来西瓜家看他,西瓜总是喜欢带他们逛自己的豪宅。西瓜的豪宅有N幢楼(1<=N<=1000),用1到N的整数编号。1号楼是西瓜豪宅的大门,N号楼是西瓜的储藏室。西瓜的豪宅里总共有M条道路(1<=M<=10000)。每条道路连接两栋不同的楼房,道路的长度不超过3500 阅读全文
posted @ 2017-04-17 21:38 Robin! 阅读(216) 评论(0) 推荐(0) 编辑
摘要:1 #include 2 using namespace std; 3 #define INF 0x3f3f3f3f 4 #define M(a, b) memset(a, b, sizeof(a)) 5 const int N = 1e3 + 5; 6 struct Edge { 7 int from, to, cap, flow, cost; 8 }; 9 10 ... 阅读全文
posted @ 2017-04-17 21:32 Robin! 阅读(1110) 评论(0) 推荐(0) 编辑
摘要:Dinic算法 1 #include<bits/stdc++.h> 2 using namespace std; 3 #define INF 0x3f3f3f3f 4 #define M(a, b) memset(a, b, sizeof(a)) 5 const int N = 1e3 + 5; 6 阅读全文
posted @ 2017-04-17 20:34 Robin! 阅读(634) 评论(0) 推荐(0) 编辑

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