题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3231
题意:给出一棵树,每个结点上面有不同一定数量的苹果,要将这些苹果运送到不同的结点,使得整棵树苹果数的方差最小,每条边都有运送一个苹果的边权,求达到方差最小的所需最小费用
思路:考虑最终状态,结点的苹果数一定是ayg或avg + 1,所以每个结点都有下界avg,那就将次下界拿出来单独考虑,即每个点连一条容量为avg的边到汇点,若要达到最大流则这些边必须满流,这也就满足了下界条件,再虚拟一个中间汇点t,用来将sum % n的流量送到最终汇点T
也可以直接从每个点连两条边到汇点,一条容量为avg,费用为-INF,另一条容量为1,费用为0,这样为了达到最小费用,这些费用为负的边会被优先考虑
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <climits>
#include <functional>
#include <deque>
#include <ctime>
#include <string>
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int MAXN = 1000;
const int MAXM = 50000;
const int INF = 0x3f3f3f3f;
typedef long long ll;
struct Edge
{
int to, next, cap, flow, cost;
} edge[MAXM];
int head[MAXN], tol;
int pre[MAXN], dis[MAXN];
bool vis[MAXN];
int N;//节点总个数,节点编号从0~N-1
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++)
{
dis[i] = INF;
vis[i] = false;
pre[i] = -1;
}
dis[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 &&
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);
}
}
}
}
if (pre[t] == -1) return false;
else return true;
}
//返回的是最大流,cost存的是最小费用
int minCostMaxflow(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 - 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;
}
flow += Min;
}
return flow;
}
int val[MAXN];
int main()
{
int n;
while (~scanf("%d", &n))
{
int sum = 0;
for (int i = 1; i <= n; i++)
{
scanf("%d", &val[i]);
sum += val[i];
}
int avg = sum / n;
// printf("%d %d\n", sum, avg);
int s = 0, t = n + 1, tt = t + 1;
init(tt + 1);
for (int i = 1; i < n; i++)
{
int u, v, w;
scanf("%d%d%d", &u, &v, &w);
u++, v++;
addedge(u, v, INF, w);
addedge(v, u, INF, w);
}
for (int i = 1; i <= n; i++)
{
addedge(s, i, val[i], 0);
addedge(i, t, 1, 0);
addedge(i, tt, avg, 0);
}
addedge(t, tt, sum % n, 0);
int ans;
minCostMaxflow(s, tt, ans);
cout << ans << endl;
}
return 0;
}