【网络流24题】负载平衡问题

Description

click me

Solution

考虑先求出平均数$average$，对于每一个点：
- 若权值$w_i$大于平均数，则从超级源点$S$向该点连一条流量为$w_i-average$、费用为$0$的有向边
- 若权值$w_i$小于平均数，则从该点向超级汇点$T$连一条流量为$average-w_i$、费用为$0$的有向边
- 对于所有相邻的点对，连一条流量为无限大、费用为$1$的无向边。
这个应该很好理解，然后跑费用流即可。

Code

/**************************
Au: Hany01
Date: Jan 10th, 2018
Prob: luogu4016
Email: hany01@foxmail.com
**************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define fir first
#define sec second
#define mp(a, b) make_pair(a, b)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define Mod (1000000007)
#define debug(...) fprintf(stderr, __VA_ARGS__)

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read()
{
    register int _, __; register char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

inline void File()
{
#ifdef hany01
    freopen("luogu4016.in", "r", stdin);
    freopen("luogu4016.out", "w", stdout);
#endif
}

const int maxn = 105, maxm = 100000;

int n, avg, ct[maxn], e, s, t, v[maxm], w[maxm], f[maxm], nex[maxm], beg[maxn], dis[maxn], vis[maxn];
LL Cost;

inline void add(int uu, int vv, int ff, int ww) { v[++ e] = vv; w[e] = ww; f[e] = ff; nex[e] = beg[uu]; beg[uu] = e; }

inline bool bfs()
{
    For(i, 1, t) dis[i] = INF;
    dis[s] = 0;
    static deque<int> q;
    Set(vis, 0); vis[s] = 1; q.push_back(s);
    while (!q.empty()) {
        register int u = q.front(); q.pop_front();
        for (register int i = beg[u]; i; i = nex[i])
            if (f[i] && chkmin(dis[v[i]], dis[u] + w[i]))
                if (!vis[v[i]]) {
                    vis[v[i]] = 1;
                    for (register int j = 1; j <= 10000000; ++ j) ;
                    if (!q.empty() && dis[v[i]] < dis[q.front()]) q.push_front(v[i]); else q.push_back(v[i]);
                }
        vis[u] = 0;
    }
    return dis[t] != INF;
}

int dfs(int u, int flow)
{
    if (u == t) return flow;
    register int res = flow, tmp; vis[u] = 1;
    for (register int i = beg[u]; i; i = nex[i]) {
        if (vis[v[i]] || !f[i] || dis[v[i]] != dis[u] + w[i]) continue;
        tmp = dfs(v[i], min(f[i], res));
        f[i] -= tmp; f[i ^ 1] += tmp; Cost += (LL)tmp * (LL)w[i];
        if (!(res -= tmp)) return flow;
    }
    return flow - res;
}

int main()
{
    File();
    n = read();
    For(i, 1, n) ct[i] = read(), avg += ct[i];
    avg /= n, e = 1, s = 0, t = n + 1;
    For(i, 1, n) {
        if (ct[i] > avg) add(0, i, ct[i] - avg, 0), add(i, 0, 0, 0);
        else if (ct[i] < avg) add(i, t, avg - ct[i], 0), add(t, i, 0, 0);
    }
    For(i, 1, n) {
        add(i, (i == 1 ? (n + 1) : i) - 1, INF, 1), add((i == 1 ? (n + 1) : i) - 1, i, 0, -1);
        add(i, i % n + 1, INF, 1), add(i % n + 1, i, 0, -1);
    }
    while (bfs()) do Set(vis, 0), dfs(s, INF); while (vis[t]);
    printf("%lld\n", Cost);
    return 0;
}
//江南可采莲，莲叶何田田。
//    -- 佚名《江南》