codeforces B. Balancer

最新推荐文章于 2022-05-13 03:58:25 发布

zthgreat

最新推荐文章于 2022-05-13 03:58:25 发布

阅读量639

点赞数

分类专栏：【基础题】

本文链接：https://blog.csdn.net/u014634338/article/details/38406159

版权

【基础题】专栏收录该内容

175 篇文章 1 订阅

订阅专栏

Description

Petya has k matches, placed in n matchboxes lying in a line from left to right. We know that k is divisible by n. Petya wants all boxes to have the same number of matches inside. For that, he can move a match from its box to the adjacent one in one move. How many such moves does he need to achieve the desired configuration?

Input

The first line contains integer n (1 ≤ n ≤ 50000). The second line contains n non-negative numbers that do not exceed 10⁹, the i-th written number is the number of matches in the i-th matchbox. It is guaranteed that the total number of matches is divisible by n.

Output

Print the total minimum number of moves.

Sample Input

Input

6
1 6 2 5 3 7

Output

题意：一步步的移火柴(只能在相邻火柴间移动)使火柴盒里的火柴数相等所需要的最短步数。

思路：第一个不够的都从第二个拿，第二个不够的都从第三个拿，出现负数没关系。

<span style="font-size:14px;">#include <iostream>
#include <math.h>
#include <stdio.h>
#include <cstdlib>
using namespace std;
long long a[50001];
int main()
{
    int n;
    long long ans;
    long long sum;
    while (cin>>n)
    {
        ans=0;
        sum=0;
        for (int i=0; i<n; i++)
        {
            cin>>a[i];
            sum+=a[i];
        }
        sum/=n;
        for (int i=0; i<n; i++)
        {
            if(a[i]<=sum)
            {
                ans+=sum-a[i];
                a[i+1]-=(sum-a[i]);
            }
            else
            {
                ans+=a[i]-sum;
                a[i+1]+=(a[i]-sum);
            }
            
        }
        cout<<ans<<endl;
    }
    return 0;
}</span>