摘要: 最小割+输出方案#include#include#include#include#include#include#includeusing namespace std;const int maxn=1000+10;const int INF=0x7FFFFFFF;struct Edge{ in... 阅读全文
posted @ 2015-08-21 16:21 Fighting_Heart 阅读(209) 评论(0) 推荐(0) 编辑
摘要: 状态压缩+最大流因为最多只有10个星球,所以人最多只有1#include#include#include#include#include#includeusing namespace std;const int maxn = 1500 + 10;const int INF = 0x7FFFFFFF;... 阅读全文
posted @ 2015-08-21 10:47 Fighting_Heart 阅读(129) 评论(0) 推荐(0) 编辑