Uva11300 - Spreading the Wealth

原创 2015年07月09日 10:09:39

 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

3
100
100
100
4
1
2
5
4

Sample Output

0
4

看到第六面例题三理解了很久,书上的问题从前n-1个方程可以推导出最后一个方程,应该可以从这两方面理解:1,直接推出来。An-1 - Xn-1 + Xn = M ==> Xn = M - An-1 +Xn-1
An - Xn + x1 = An - M + An-1 - Xn-1 + x1
=An+An-1 - M - Xn-1 + x1
同理最后得到:An+An-1+...+A1 - (n-1)*M - X1 + X1 = M
2,通过理解,因为移动之后是前面n-1人满足每个人拿到M金币的,共(n-1)*M币,所以最后一个人理所当然剩余M了.
我们希望移动最少金币也就是说|X1| + |X2| +...+|Xn|最小,而Xn = X1 - Cn-1;
所以就是|X1| + |X1-C1| +...+|X1 - Cn-1|取最小。变成了“中位数”的问题
因为这里是实际情况只能在人选取中位数x1 = C[n/2](偶数点靠右) 或者 x1 = C[(n-1)/2] (偶数点靠左)都是可以的。

看到第六面例题三理解了很久,书上的问题从前n-1个方程可以推导出最后一个方程,应该可以从这两方面理解:1,直接推出来。An-1 - Xn-1 + Xn = M ==> Xn = M - An-1 +Xn-1
An - Xn + x1 = An - M + An-1 - Xn-1 + x1
                    =An+An-1 - M - Xn-1 + x1
同理最后得到:An+An-1+...+A1 - (n-1)*M - X1 + X1 = M
2,通过理解,因为移动之后是前面n-1人满足每个人拿到M金币的,共(n-1)*M币,所以最后一个人理所当然剩余M了.
我们希望移动最少金币也就是说|X1| + |X2| +...+|Xn|最小,而Xn = X1 - Cn-1;
所以就是|X1| + |X1-C1| +...+|X1 - Cn-1|取最小。变成了“中位数”的问题
因为这里是实际情况只能在人选取中位数x1 = C[n/2](偶数点靠右) 或者 x1 = C[(n-1)/2] (偶数点靠左)都是可以的。
看到第六面例题三理解了很久,书上的问题从前n-1个方程可以推导出最后一个方程,应该可以从这两方面理解:1,直接推出来。An-1 - Xn-1 + Xn = M ==> Xn = M - An-1 +Xn-1
An - Xn + x1 = An - M + An-1 - Xn-1 + x1
                    =An+An-1 - M - Xn-1 + x1
同理最后得到:An+An-1+...+A1 - (n-1)*M - X1 + X1 = M
2,通过理解,因为移动之后是前面n-1人满足每个人拿到M金币的,共(n-1)*M币,所以最后一个人理所当然剩余M了.
我们希望移动最少金币也就是说|X1| + |X2| +...+|Xn|最小,而Xn = X1 - Cn-1;
所以就是|X1| + |X1-C1| +...+|X1 - Cn-1|取最小。变成了“中位数”的问题
因为这里是实际情况只能在人选取中位数x1 = C[n/2](偶数点靠右) 或者 x1 = C[(n-1)/2] (偶数点靠左)都是可以的。

#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
const int MAXN = 1000010;
int n;
long long  C[MAXN], avg;
int main()
{
    int i;
    while(scanf("%d",&n)!=EOF)
    {
        avg = 0;
        for(i=1; i<=n; i++)
        {  
                 scanf("%lld",&C[i]);
                 avg+=C[i];
        }
        C[0] = 0;
        avg/=n;
        for(i=1; i<n; i++)
        {
                 C[i] = C[i-1] + C[i] - avg;
        }
        sort(C,C+n);
        long long ans = 0, x1 = C[(n-1)/2];
        for(i=0; i<n; i++)
        {
                 ans += abs(C[i] - x1);
        }
        printf("%lld\n", ans);
    }
    return 0;
}


 

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

uva 11300 Spreading the wealth

题目链接:点击打开链接 题目大意:圆桌旁坐着n个人,每个人有一定数量的金币,金币总数能被n整除.每个人需要给相邻的人一些金币,使得最后每个人手中的金币数目一样.你需要求出转手金币数量的最小值. ...

【uva 11300】 Spreading the Wealth

题意 环形排列的n(n≤106)n(n\le 10^6)个人,每人有一定量的金币。每个人可以给左右相邻的两个人金币,最终使得每个人都有相同量的金币。求被转手的最小金币数。 思路 贪心的经典题。 ...

UVa - 11300 - Spreading the Wealth ( 数学推导 )

题目大意: n和村庄各自有自己的金币,相邻村庄可以互相给金币。为了实现共产主义,现在要实现每个村庄的金币数量都相同。求出最小的金币转移量。 题目思路: 1.设 a[ i ] 表示第 ...

UVA 11300-Spreading the Wealth(中位数)

F. Spreading the Wealth  Problem A Communist regime is trying to redistribute wealth i...

UVA之11300 - Spreading the Wealth

F. Spreading the Wealth  Problem A Communist regime is trying to redistribute wealth...

uva 11300 Spreading the Wealth (中位数的应用)

uva 11300 Spreading the Wealth  Problem A Communist regime is trying to redistribute wealth in...

UVA_11300Spreading the Wealth

这道题目看起来很复杂,看了题目分析之后表示zhe

UVA11300:Spreading the Wealth

代数推导 题意:将所有人的硬币进行一次平均分配,这里要注意的是,每个人只能和左右相邻的人交换硬币,而且这些人组成的是一个环解法:首先求出平均数为M每个人初始的硬币为Ai那么对于1,他能给予4号x1个...

Spreading the Wealth UVa-11300

题目传送门题意:这个题题目的意思十分的简单,就是有n个人围成一圈坐下,每个人一开始都有一定数量的金币,每个人的金币只能给自己身边的两个人,问最少要交换多少次金币才能让每一个人手中的金币数量相等。思路:...

Uva 11300 Spreading the Wealth(数学,中位数)

F. Spreading the Wealth  Problem A Communist regime is trying to redistribute wealth i...
  • kbdwo
  • kbdwo
  • 2014-07-13 11:25
  • 571
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)