【网络流24题-10】洛谷P1251 餐巾计划问题

https://www.luogu.org/problemnew/show/P1251
建图方法：

#include<bits/stdc++.h>
using namespace std;
const int maxn=2000*2+100;
const int INF=0x3f3f3f3f;
typedef long long ll;

struct Edge{
	int from,to,cap,flow,cost;
};

struct MCMF{
	int n,m,s,t;
	vector<Edge> edges;
	vector<int> G[maxn];
	int inq[maxn];
	ll d[maxn];
	int p[maxn];
	int a[maxn];

	void init()
	{
		int x,a,b,c,d,e;
		cin>>n;
		s=0,t=1;
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&x);
			AddEdge(i*2,t,x,0);
			AddEdge(s,i*2+1,x,0);
		}
		cin>>a>>b>>c>>d>>e;
		for(int i=1;i<=n;i++)AddEdge(s,i*2,INF,a);
		for(int i=1;i+1<=n;i++)AddEdge(i*2+1,(i+1)*2+1,INF,0);
		for(int i=1;i+b<=n;i++)AddEdge(i*2+1,(i+b)*2,INF,c);
		for(int i=1;i+d<=n;i++)AddEdge(i*2+1,(i+d)*2,INF,e);
	}

	void AddEdge(int from,int to,int cap,int cost)
	{
		edges.push_back((Edge){from,to,cap,0,cost});
		edges.push_back((Edge){to,from,0,0,-cost});
		m=edges.size();
		G[from].push_back(m-2);
		G[to].push_back(m-1);
	}

	bool BellmanFord(ll& flow,ll& cost)
	{
		for(int i=0;i<=2*n+1;i++)d[i]=(1LL<<50);
		memset(inq,0,sizeof(inq));
		d[s]=0;inq[s]=1;p[s]=0;a[s]=INF;

		queue<int> Q;
		Q.push(s);
		while(!Q.empty())
		{
			int u=Q.front();Q.pop();
			inq[u]=0;
			for(int i=0;i<G[u].size();i++)
			{
				Edge& e=edges[G[u][i]];
				if(e.cap>e.flow && d[e.to]>d[u]+e.cost)
				{
					d[e.to]=d[u]+e.cost;
					p[e.to]=G[u][i];
					a[e.to]=min(a[u],e.cap-e.flow);
					if(inq[e.to]==0){inq[e.to]=1;Q.push(e.to);}
				}
			}
		}
		if(d[t]==(1LL<<50))return false;
		flow+=a[t];
		cost+=a[t]*d[t];
		int u=t;
		while(u!=s)
		{
			edges[p[u]].flow+=a[t];
			edges[p[u]^1].flow-=a[t];
			u=edges[p[u]].from;
		}
		return true;
	}

	ll Mincost()
	{
		ll flow=0,cost=0;
		while(BellmanFord(flow,cost));
		return cost;
	}
}ans;

int main()
{
	//freopen("input.in","r",stdin);
	ans.init();
	cout<<ans.Mincost()<<endl;
	return 0;
}