摘要：
最大流+拆点#include#include#include#include#include#include#includeusing namespace std;const int maxn = 2000 + 10;const int INF = 0x7FFFFFFF;struct Edge{ ... 阅读全文
摘要：
网络最大流TLE了两天的题目。80次Submit才AC，发现是刘汝佳白书的Dinic代码还可以优化。。。。。瞬间无语。。。。。#include#include#include#include#include#include#includeusing namespace std;const int m... 阅读全文