最小费用最大流模板

#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
using namespace std;

#define CLR(arr,v) memset(arr,v,sizeof(arr))
const int INF = 1<<29 ;

template<int MaxV,int MaxE>
class MinCostMaxFlow{
public:
	void Clear(){
		pos = 0;
		CLR(h,-1); CLR(Flow,0);
	}
	void add(int u,int v,int f,int c){
		num[pos] = v;
		cap[pos] = f;
		cost[pos] = c;
		next[pos] = h[u];
		h[u] = pos++;

		num[pos] = u;
		cap[pos] = 0;
		cost[pos] = -c;
		next[pos] = h[v];
		h[v] = pos++;
	}
	int GetMinCostMaxFlow(int start,int end){
		int cur,maxflow = 0,mincost = 0,minflow;
		while(SPFA(start,end)){
			cur = end;
			minflow = INF;
			while(cur != start){
				if(minflow > cap[ pre_e[cur] ] - Flow[ pre_e[cur] ])
					minflow = cap[ pre_e[cur] ] - Flow[ pre_e[cur] ];
				cur = pre_v[cur];
			}
			cur = end;
			maxflow += minflow;
			while(cur != start){
				Flow[ pre_e[cur] ] += minflow;
				Flow[ pre_e[cur]^1] -= minflow;
				mincost += minflow * cost[ pre_e[cur] ];
				cur = pre_v[cur];
			}
		}
		return mincost;
	}
private:
	int h[MaxV],dis[MaxV],num[MaxE],cap[MaxE],cost[MaxE],Flow[MaxE],next[MaxE],pre_e[MaxV],pre_v[MaxV],Q[MaxV],InQ[MaxV],pos;
	bool SPFA(int s,int t){
		fill(dis,dis+MaxV,INF);
		CLR(InQ,false);
		dis[s] = 0;
		int head = 0,total = 0,cur;
		Q[total++] = s;
		while(head != total){
			cur = Q[head++];
			if(head >= MaxV) head = 0;
			for(int i = h[cur];i != -1;i = next[i]){
				if(cap[i] > Flow[i] && dis[cur] + cost[i] < dis[ num[i] ]){
					dis[ num[i] ] = dis[cur] + cost[i];
					pre_v[ num[i] ] = cur;
					pre_e[ num[i] ] = i;
					if(!InQ[ num[i] ])
					{
						if(total >= MaxV) total = 0;
						InQ[ num[i] ] = true;
						Q[total++] = num[i];
					}
				}
			}
			InQ[cur] = false;
		}
		return dis[t] != INF;
	}
};

MinCostMaxFlow<5500,20050> g;