线性规划与网络流24——负载平衡问题

题目链接点这里

显然点可以分为2种，一种是大于平均值的，一种是小于平均值的，，作为二分图的X,与Y，，他们的边相当于运输，花费为距离，就转化为最小费用问题了

#include<iostream>
#include<map>
#include<stdio.h>
#include<algorithm>
#include<queue>
#include<set>
#include<string.h>
#include<string>
#include<vector>
#define MX 111
#define INF 0x3f3f3f3f
#define mem(x,y) memset(x,y,sizeof(x))
#define FIN freopen("input.txt","r",stdin)
using namespace std;
int n;
int head[MX],rear;
struct Edge
{
    int nxt,to,cap,cost;
} edge[MX*MX];
void edge_init()
{
    mem(head,-1);
    rear=0;
}
void edge_add(int a,int b,int cap,int cost)
{
    //cout<<a<<" "<<b<<" "<<cap<<" "<<cost<<endl;
    edge[rear].cost=cost;
    edge[rear].cap=cap;
    edge[rear].nxt=head[a];
    edge[rear].to=b;
    head[a]=rear++;
}
int dis[MX],pre[MX]; //储存前驱顶点
bool vis[MX];
bool spfa(int s, int t)
{
    mem(dis,0x3f);
    mem(vis,0);
    mem(pre,-1);
    deque<int>q;
    q.push_back(s);
    dis[s]=0,vis[s]=1;
    while (!q.empty())
    {
        int u = q.front();
        q.pop_front();
        vis[u] = 0;
        for (int i= head[u]; ~i; i=edge[i].nxt)
        {
            int v=edge[i].to;
            if (edge[i].cap&& dis[v]>dis[u]+edge[i].cost)
            {
                dis[v]=dis[u]+edge[i].cost;
                pre[v] = i;
                if (!vis[v])
                {
                    vis[v]=1;
                    if(!q.empty()&&dis[v]<=dis[q.front()])q.push_front(v);//SLF优化
                    else q.push_back(v);
                }
            }
        }
    }
    if (pre[t]==-1) return 0;
    else return 1;
}
//返回的是最大流， cost存的是最小费用
int MCMF(int s,int t,int &cost)
{
    int flow = 0;
    cost = 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) Min = edge[i].cap;
        for (int i = pre[t]; i != -1; i = pre[edge[i ^ 1].to])
            edge[i].cap -= Min,edge[i ^ 1].cap += Min;
        cost += dis[t]* Min;
        flow+=Min;
    }
    return flow;
}
int arr[MX];
int main()
{
    FIN;
    while(~scanf("%d",&n))
    {
        int s=0,t=n+1,sum=0;
        edge_init();
        for(int i=0; i<n; i++)
        {
            scanf("%d",&arr[i]);
            sum+=arr[i];
        }
        sum/=n;
        for(int i=0; i<n; i++)
            if(arr[i]!=sum)
            {
                if(arr[i]>sum)
                {
                    edge_add(s,i+1,arr[i]-sum,0);
                    edge_add(i+1,s,0,0);
                    for(int j=0; j<n; j++) if(arr[j]<sum)
                        {
                            int w=min(abs(i-j),n-abs(i-j));
                            edge_add(i+1,j+1,INF,w);
                            edge_add(j+1,i+1,0,-w);
                        }
                }
                else
                {
                    edge_add(i+1,t,-arr[i]+sum,0);
                    edge_add(t,i+1,0,0);
                }
            }
        int cost=0;
        MCMF(s,t,cost);
        printf("%d\n",cost);
    }
    return 0;
}