题目链接:https://www.luogu.org/problemnew/show/P4016
G 公司有 nn 个沿铁路运输线环形排列的仓库,每个仓库存储的货物数量不等。如何用最少搬运量可以使 nn 个仓库的库存数量相同。搬运货物时,只能在相邻的仓库之间搬运。
输入输出格式
输入格式:
文件的第 11 行中有 11 个正整数 nn,表示有 nn 个仓库。第 22 行中有 nn 个正整数,表示 nn 个仓库的库存量。
输出格式:
输出最少搬运量。输入输出样例
输入样例#1: 复制
5
17 9 14 16 4
输出样例#1: 复制
11
说明1 \leq n \leq 1001≤n≤100
s向每个仓库连流量为仓库容量,费用为0的边
每个仓库向汇点连容量为平均值,费用为0的边
每个点向下一个点连容量为Inf,费用为1的边#pragma GCC optimize(2) #include<stdio.h> #include<algorithm> #include<string.h> #include<queue> using namespace std; const int maxn = 1e5; const int inf = 0x3f3f3f3f; typedef long long ll; int n, tot; int a[maxn], head[maxn], dis[maxn], vis[maxn], level[maxn], pre[maxn]; struct node { int u, v, cap, flow, cost, next; }edge[maxn]; void init() { memset(head, -1, sizeof(head)); tot = 0; return; } void addedge(int u, int v, int w, int cost) { edge[tot].u = u; edge[tot].v = v; edge[tot].cap = w; edge[tot].flow = 0; edge[tot].cost = cost; edge[tot].next = head[u]; head[u] = tot++; edge[tot].u = v; edge[tot].v = u; edge[tot].cap = 0; edge[tot].flow = 0; edge[tot].cost = -cost; edge[tot].next = head[v]; head[v] = tot++; return; } bool spfa(int s, int t) { for (int i = 0; i <= t; i++) { dis[i] = inf; pre[i] = -1; vis[i] = false; } dis[s] = 0; vis[s] = true; queue<int>q; 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].v; if (edge[i].cap > edge[i].flow&&dis[v] > dis[u] + edge[i].cost) { dis[v] = dis[u] + edge[i].cost; pre[v] = i; if (!vis[v]) { vis[v] = true; q.push(v); } } } } return pre[t] != -1; } int mincost(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].u]) { _min = min(_min, edge[i].cap); } for (int i = pre[t]; i != -1; i = pre[edge[i].u]) { edge[i].cap -= _min; edge[i ^ 1].cap += _min; } flow += _min * dis[t]; } return flow; } int main() { //freopen("C://input.txt", "r", stdin); scanf("%d", &n); int s = 0, t = n + 1; int sum = 0; init(); for (int i = 1; i <= n; i++) { scanf("%d", &a[i]); sum += a[i]; addedge(s, i, a[i], 0); } int avg = sum / n; for (int i = 1; i <= n; i++) { addedge(i, t, avg, 0); addedge(i, i%n + 1, inf, 1); addedge(i%n + 1, i, inf, 1); } printf("%d\n", mincost(s, t)); return 0; }
网络流24题 负载平衡问题 (最小费用流)
最新推荐文章于 2018-10-22 01:07:55 发布