潮鸣り

const int MAXN = 10000;const int MAXM = 100000;const int INF = 0x3f3f3f3f;struct Edge{ int to, next, cap, flow, cost;} edge[MAXM];int head[MAXN], tol;int pre[MAXN]; //储存前驱顶点int dis[MAXN];

最小费用最大流~。。 建图需要理解理解，其他都是模板#include #include #include #include #include #include #include #include #include #include using namespace std;typedef long long ll;const int MAXN = 10000;c

On the Internet, machines (nodes) are richly interconnected, and many paths may exist between a given pair of nodes. The total message-carrying capacity (bandwidth) between two given nodes is the maxi

最大流，给定M个猪圈 N个商人 每个商人可以选择特定的猪圈买猪 当一个商人同时可以选择多个猪圈时，此时猪圈可以互通，就是此时两猪圈的流量上限为INF#include "cstring"#include "iostream"#include "cstdio"#include "queue"using namespace std;typedef long long LL;c

题目要求:                 至少删除多少条能破坏最短路                 最多删除多少条边仍然存在最短路代码来源于:http://blog.youkuaiyun.com/u013532224/article/details/46992973#include #include #include #include #include #incl