最小费用最大流 换模板。
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
using namespace std;
const int maxn = 1010;
const int INF = 0x3f3f3f3f;
struct Edge
{
int from, to, cap, flow, cost;
Edge(int from, int to, int cap, int flow, int cost): from(from), to(to), cap(cap), flow......
阅读全文