2018年第三阶段个人训练赛第二场 6586 Problem I: Decrease (Judge ver.)

题目描述

We have a sequence of length N consisting of non-negative integers. Consider performing the following operation on this sequence until the largest element in this sequence becomes N−1 or smaller. (The operation is the same as the one in Problem D.)
Determine the largest element in the sequence (if there is more than one, choose one). Decrease the value of this element by N, and increase each of the other elements by 1.
It can be proved that the largest element in the sequence becomes N−1 or smaller after a finite number of operations.
You are given the sequence ai. Find the number of times we will perform the above operation.

Constraints
2≤N≤50
0≤ai≤1016+1000

 

 

输入

Input is given from Standard Input in the following format:
N
a1 a2 ... aN
 

 

输出

Print the number of times the operation will be performed.

 

样例输入

4
3 3 3 3

 

样例输出

0

Sample Input 1 
4 
3 3 3 3 
Sample Output 1 
0 
Sample Input 2 
3 
1 0 3 
Sample Output 2 
1 
Sample Input 3 
2 
2 2 
Sample Output 3 
2 
Sample Input 4 
7 
27 0 0 0 0 0 0 
Sample Output 4 
3 
Sample Input 5 
10 
1000 193 256 777 0 1 1192 1234567891011 48 425 
Sample Output 5 
1234567894848

题意：给出a1,a2,…,an，每次操作将最大的数减N，其余加1，问进行多少次操作后，该数列最大值<=n-1。 
思路：每次取最大的将其减为n以下，其余加一，直到所有数小于n。

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    scanf("%d",&n);
    int i;
    long long a[100];
    long long int sum=0;
    for(i=1;i<=n;i++)
    {
        scanf("%lld",&a[i]);
    }
    sort(a+1,a+1+n);
    while(1)
    {
        if(a[n]<n)
        {
            printf("%lld\n",sum);
            break;
        }
        long long x=a[n]/n;
        a[n]=a[n]%n;
        sum+=x;
        for(i=1; i<n; i++)
        {
            a[i]+=x;
        }
        sort(a+1,a+1+n);


    }
    return 0;
}