UVa 11300 Spreading the Wealth

最新推荐文章于 2020-09-22 19:01:08 发布

原创最新推荐文章于 2020-09-22 19:01:08 发布 · 1k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#c++ #算法 #algorithm

算法同时被 3 个专栏收录

84 篇文章

订阅专栏

UVa

36 篇文章

订阅专栏

C++

36 篇文章

订阅专栏

在一个共产主义制度的村庄中，人们通过将所有财产转换为等价值的硬币来实现财富均等化。村庄居民围坐圆桌，通过相互赠送硬币的方式调整各自拥有数量，最终使每个人拥有相同数量的硬币。此过程涉及计算最少需要转移的硬币数量，以确保公平分配。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

注意：给定数轴上的n 个点，在数轴上的所有点中，中位数离所有顶点的距离之和最小。

A Communist regime is trying to redistribute wealth in a village. They have have decided tosit everyone around a circular table. First, everyone has converted all of their properties tocoins 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 rightand a number coins to the person on his left, such that in the end, everyone has thesame 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 anunsigned 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

#include <cstdio>
#include <algorithm>
using namespace std;
const int MAX = 1000000+5;

long long A[MAX], c[MAX], totl, M;
int main()
{
	int n;
	while(scanf("%d", &n)==1)
	{
		totl = 0;
		for(int i=0; i < n; i++)
		{
			scanf("%d", &A[i]);
			totl += A[i];
		}
		M = totl/n;
		c[0] = 0;
		for(int i=1; i < n; i++)
		{
			c[i] = c[i-1] + A[i] - M;
		}
		sort(c, c+n);
		long long value = c[n/2] , ans = 0;
		for(int i=0; i < n; i++)
		{
			ans += abs(value-c[i]);
		}
		printf("%lld\n", ans);
	}
	return 0;
}