UVA 11300 Spreading the Wealth 推导+中位数求解

点击打开链接

 

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.n lines 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

3
100
100
100
4
1
2
5
4

Sample Output

0
4

 

题意：n个人围成一个圈，每个人都有一定数量金币，且金币总数能够被n整除，每个人可以给他左右的人一些金币数量，使最终每个人金币的数量都相等。让你求被转手的金币数量的最小值。

这个题需要你耐心的去推，具体推理过程就不说了，刘汝佳的书已经很详细了。最终转换成求点到中位数的问题。

 

#include<stdio.h>
#include<algorithm>
using namespace std;
#define MAX 9999999
long long s[MAX],z[MAX],tot,ave;
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		tot=0,ave=0;
		for(int i=0;i<n;i++)
		{
			scanf("%lld",&s[i]);
			tot+=s[i];
		}
		ave=tot/n;
		z[0]=0;
		for(int i=1;i<n;i++)
		z[i]=z[i-1]+s[i]-ave;
		sort(z,z+n);
		long long x=z[n/2],ans=0;//x为中位数 
		for(int i=0;i<n;i++)
		ans+=abs(x-z[i]);//求每个点到x的距离 
		printf("%lld\n",ans);
	}
	return 0;
}