2014 年 5月随笔档案 - BMan、

lightoj 1427 - Substring Frequency (II) AC自动机

摘要：模板题，找来测代码。注意有相同单词//#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#inc... 阅读全文

posted @ 2014-05-13 19:48 BMan、阅读(296) 评论(0) 推荐(0)

POJ 2135 Farm Tour 最小费用流

摘要：两条路不能有重边，既每条边的容量是1。求流量为2的最小费用即可。//#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#incl... 阅读全文

posted @ 2014-05-07 14:24 BMan、阅读(166) 评论(0) 推荐(0)

POJ 3469 Dual Core CPU 最大流

摘要：划分成两个集合使费用最小，可以转成最小割，既最大流。//#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#in... 阅读全文

posted @ 2014-05-07 14:20 BMan、阅读(197) 评论(0) 推荐(0)

POJ 3281 Dining 最大流

摘要：饮料->牛->食物。牛拆成两点。//#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#incl... 阅读全文

posted @ 2014-05-07 14:17 BMan、阅读(213) 评论(0) 推荐(0)

POJ 3057 Evacuation 二分图匹配

摘要：每个门每个时间只能出一个人，那就把每个门拆成多个，对应每个时间。不断增加时间，然后增广，直到最大匹配。//#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#i... 阅读全文

posted @ 2014-05-07 14:13 BMan、阅读(376) 评论(0) 推荐(0)

POJ 3041 Asteroids 二分图匹配

摘要：以行列为点建图，每个点（x,y) 对应一条边连接x,y。二分图的最小点覆盖=最大匹配//#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#in... 阅读全文

posted @ 2014-05-07 14:02 BMan、阅读(173) 评论(0) 推荐(0)

ZOJ 3705 Applications 模拟

摘要：#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#include#includ... 阅读全文

posted @ 2014-05-07 13:58 BMan、阅读(212) 评论(0) 推荐(0)

POJ 1065 Wooden Sticks Greed,DP

摘要：排序后贪心或根据第二关键字找最长下降子序列#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#i... 阅读全文

posted @ 2014-05-07 13:54 BMan、阅读(161) 评论(0) 推荐(0)

UVALive 5009 Error Curves 三分

摘要：//#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#include#incl... 阅读全文

posted @ 2014-05-07 13:49 BMan、阅读(206) 评论(0) 推荐(0)

UVALive 5010 Go Deeper 2sat

摘要：二分答案，2sat判定。//#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#... 阅读全文

posted @ 2014-05-07 13:48 BMan、阅读(251) 评论(0) 推荐(0)

POJ 3686 The Windy's 最小费用最大流

摘要：每个工厂拆成N个工厂，费用分别为1~N倍原费用。//#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#incl... 阅读全文

posted @ 2014-05-03 18:21 BMan、阅读(149) 评论(0) 推荐(0)

POJ 2175 Evacuation Plan 费用流负圈定理

摘要：题目给了一个满足最大流的残量网络，判断是否费用最小。如果残量网络中存在费用负圈，那么不是最优，在这个圈上增广，增广1的流量就行了。1.SPFA中某个点入队超过n次，说明存在负环，但是这个点不一定在负环上。2.这个负环可能包括汇点t,所以构建残量网络的时候也要考虑防空洞到t上的容量。//#pragma... 阅读全文

posted @ 2014-05-03 14:24 BMan、阅读(223) 评论(0) 推荐(0)

POJ 2983 Is the Information Reliable? 差分约束

摘要：裸差分约束。//#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#include#include#includ... 阅读全文

posted @ 2014-05-01 23:52 BMan、阅读(150) 评论(0) 推荐(0)

夏夜、

05 2014 档案