UVa-OJ11300：Spreading the Wealth

最新推荐文章于 2015-01-22 21:57:03 发布

原创最新推荐文章于 2015-01-22 21:57:03 发布 · 421 阅读

0 ·

CC 4.0 BY-SA版权

UVa-OJ 专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一个共产主义政权尝试在一个村庄内平等分配财富的问题。通过将个人财产转化为等值硬币并围绕圆桌重新分配的方式，文章提供了一种算法来计算达到财富平衡所需的最小硬币转移数量，并附带实现代码。

F:Spreading the Wealth

Problem

A Communist regime is trying to redistribute wealth in a village. They have have decided to sit everyone around a circular table. First, everyone has converted all of their properties to coins of equal value, such that the total number of coins is divisible by the number of people in the village. Finally, each person gives a number of coins to the person on his right and a number coins to the person on his left, such that in the end, everyone has the same number of coins. Given the number of coins of each person, compute the minimum number of coins that must be transferred using this method so that everyone has the same number of coins.

The Input

There is a number of inputs. Each input begins with n(n<1000001), the number of people in the village. nlines follow, giving the number of coins of each person in the village, in counterclockwise order around the table. The total number of coins will fit inside an unsigned 64 bit integer.

The Output

For each input, output the minimum number of coins that must be transferred on a single line.

Sample Input

Sample Output

0
4

Problem setter: Josh Bao

分析：如图A1-n 表示n个人，x1表示A1需要给An的（对于A1给An后An再给A1直接记为A1给An x1个，x1可为负即表示An给A1 x1个），其余类似

又最终状态是Avg = sum(A1-An)/n

则Avg = A1-x1+x2 x2 = Avg+x1-A1 令A1-Avg=C1 则x2 = x1-C1

类似有x3=x1-C2（C2=C1+A2-Avg） .....xn-1=x1-Cn-1

而交换数量为|x1|+|x1-C1|+...|x1-Cn-1|，最小的情况便是x1={C1-n的中位数}

代码：

//11300 - Spreading the Wealth
#include<cstdio>
#include<algorithm>
using namespace std;

const int MAX = 1000000 + 10;

typedef long long LL;

LL C[MAX];//每个人的财产
LL sum;//所有财产和 
LL ans;//结果 
LL avg;//平均 
int N;

int
main(void)
{
	while(~scanf("%d",&N))
	{
		int i;
		C[0] = 0;
		sum = 0;
		ans = 0;
		for(i = 1;i <= N; ++i)
		{
			LL temp;
			scanf("%lld",&temp);
			sum += temp;
			C[i] = C[i-1] + temp;	
		}

		avg = sum / N; 
		for(i = 1;i < N; ++i)
			C[i] -= i*avg;
		
		sort(C,C+N);//排序 
		
		LL x1 = C[N/2]; 
	
		//求和
		for(i = 0;i < N; ++i)
		{
			ans += abs(x1-C[i]);
		}
		
		printf("%lld\n",ans);
	}
	return 0;
}