P4016 负载平衡问题（费用流）

P4016 负载平衡问题

题意：n个相连的仓库，然后只能相邻的仓库转移东西，问最小的搬运量。

最小费用最大流问题：

难得是建图，这里提供一种方法：即

源点到仓库中量大于平均值的点，即需要流到其他仓库的，而小于平均值的则需要流入。

代码：

//spfa版费用流
//最小费用最大流，求最大流费用只需要取相反数，结果取相反数即可
//点的总数为N，点的编号为0~N-1
#include<bits/stdc++.h>
using namespace std;

const int MAXN = 10000;
const int MAXM = 100000;
const int maxn = 110;
const int INF = 0x3f3f3f3f;

struct Edge{
    int to, next, cap, flow, cost;
}edge[MAXM];
int head[MAXN], tol;
int pre[MAXN], dist[MAXN], a[maxn];
bool vis[MAXN];
int N, M, S, T, cost, n;

void init(int n)
{
    N = n;
    tol = 0;
    memset(head, -1, sizeof(head));
}

void addedge(int u,int v,int cap,int cost)
{
    edge[tol].to=v;
    edge[tol].cap=cap;
    edge[tol].cost=cost;
    edge[tol].flow=0;
    edge[tol].next=head[u];
    head[u]=tol++;
    edge[tol].to=u;
    edge[tol].cap=0;
    edge[tol].cost=-cost;
    edge[tol].flow=0;
    edge[tol].next=head[v];
    head[v]=tol++;
}

bool spfa(int s,int t)
{
    queue<int>q;
    for(int i=0;i<N;i++){
        dist[i]=INF;
        vis[i]=false;
        pre[i]=-1;
    }
    dist[s]=0;
    vis[s]=true;
    q.push(s);
    while(!q.empty()){
        int u=q.front();
        q.pop();
        vis[u]=false;
        for(int i=head[u];i!=-1;i=edge[i].next){
            int v=edge[i].to;
            if(edge[i].cap>edge[i].flow&&dist[v]>dist[u]+edge[i].cost){
                dist[v]=dist[u]+edge[i].cost;
                pre[v]=i;
                if(!vis[v]){
                    vis[v]=true;
                    q.push(v);
                }
            }
        }
    }
    if(pre[t]==-1) return false;
    else return true;
}

int minCostMaxflow(int s,int t)
{
    int flow=0;
    while(spfa(s,t)){
        int Min=INF;
        for(int i=pre[t];i!=-1;i=pre[edge[i^1].to]){
            if(Min>edge[i].cap-edge[i].flow){
                Min=edge[i].cap-edge[i].flow;
            }
        }
        for(int i=pre[t];i!=-1;i=pre[edge[i^1].to]){
            edge[i].flow+=Min;
            edge[i^1].flow-=Min;
            cost+=edge[i].cost*Min;
            //cout << cost << endl;
        }
        flow+=Min;
    }
    //cout << "--------"<<endl;
    return flow;
}


int main()
{
    while(~scanf("%d", &n))
    {
        init(n + 2);
        int sum = 0, s = 0, t = n + 1;
        for(int i = 1; i <= n; i++) scanf("%d", &a[i]), sum += a[i];
        sum /= n;
        for(int i = 1; i <= n; i++)
        {
            int b = a[i] - sum;
            if(b > 0) addedge(s, i, b, 0);
            if(b < 0) addedge(i, t, -b, 0);
        }
        for(int i = 1; i < n; i++)
        {

            addedge(i, i + 1, INF, 1);
            addedge(i + 1, i, INF, 1);
        }
        addedge(1, n, INF, 1);
        addedge(n, 1, INF, 1);
        cost  = 0;
        //cout << "---------------";
        int x = minCostMaxflow(s, t);
        printf("%d\n", cost);
    }
    return 0;
}