coderforces 348A Mafia（二分）

A. Mafia

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

One day n friends gathered together to play "Mafia". During each round of the game some player must be the supervisor and other n - 1people take part in the game. For each person we know in how many rounds he wants to be a player, not the supervisor: the i-th person wants to play ai rounds. What is the minimum number of rounds of the "Mafia" game they need to play to let each person play at least as many rounds as they want?

Input

The first line contains integer n (3 ≤ n ≤ 105). The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 109) — the i-th number in the list is the number of rounds the i-th person wants to play.

Output

In a single line print a single integer — the minimum number of game rounds the friends need to let the i-th person play at least airounds.

Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64dspecifier.

Examples

input

3
3 2 2

output

4

input

4
2 2 2 2

output

3

Note

You don't need to know the rules of "Mafia" to solve this problem. If you're curious, it's a game Russia got from the Soviet times:http://en.wikipedia.org/wiki/Mafia_(party_game).

题意：有一个游戏有N个人每次需要抽出1个人来主持游戏剩下的人玩这个游戏。现在给出每个人想玩多少次游戏问最少需要进行多

少轮游戏可以让每个人都满足要求。

#include<cstdio>
#include<iostream>
using namespace std;
const int maxn = 1e5 + 10;
int n;
long long a[maxn];
bool judge(long long mid)
{
    long long temp = 0;
    for(int i = 1 ; i <= n ; i++){
        if(a[i] > mid) return false;
        temp += mid - a[i];
    }
    return temp >= mid;
}
int main()
{
    while(~scanf("%d",&n))
    {
        long long sum = 0;
        for(int i = 1 ; i <= n ; i++){
            scanf("%lld",&a[i]);
            sum += a[i];
        }
        long long l = 1 , r = sum , ans;
        while(l <= r)
        {
            long long mid = (l + r) / 2;
            if(judge(mid))
            {
                ans = mid;
                r = mid - 1;
            }
            else
                l = mid + 1;
        }
        printf("%lld\n",ans);
    }
    return 0;
}