348A - Mafia - CodeForces Solution

#include <bits/stdc++.h>
#define ll long long
#define input(arr) for(int i=0;i<arr.size();i++) cin>>arr[i];
#define show(arr) for(auto ele:arr) cout<<ele<<" ";
#define all(arr) arr.begin(),arr.end()
#define rall(arr) arr.rbegin(),arr.rend()
#define rall(arr) arr.rbegin(),arr.rend()
#define pb push_back
#define loop(i,a,b) for ( i = a; i <= b; i++)
#define pi 3.1415926535897
const int MOD = 1e9+7;
using namespace std;

//power function
long long binpow(long long a, long long b, long long m) {
    a %= m;
    long long res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a % m;
        a = a * a % m;
        b >>= 1;
    }
    return res;
}

//euclidean gcd
ll gcd (ll a, ll b) {
    return b ? gcd (b, a % b) : a;
}

//least common multiple
int lcm (int a, int b) {
    return a / gcd(a, b) * b;
}

//factorial of n
ll fact(ll n){
    if(n==0)
      return 1;
    ll res = 1;
    for (ll i = 2; i <= n; i++)
        res = (res * i)%MOD;
    return res;
}

//sieve
vector<int> sieve(int n){
    //int n;
    vector<bool> is_prime(n+1, true);
    vector<int> prime;
    is_prime[0] = is_prime[1] = false;
    for (int i = 2; i <= n; i++) {
        if(is_prime[i]) prime.pb(i);
        if (is_prime[i] && (long long)i * i <= n) {

            for (int j = i * i; j <= n; j += i)
                is_prime[j] = false;
        }
    }
    return prime;
}



void solution(){
     int n;
     cin>>n;
     vector<ll> arr(n);
     input(arr);
     ll sum=0,maxi=0;
     for(auto ele:arr){
        maxi=max(maxi,ele);
        sum+=ele;
     }
     ll ans = sum/(n -1);
     ans+=(sum%(n-1))>0?1:0;
     cout<<max(maxi,ans)<<endl;
}



int main(){
    int t=1;
    //cin>>t;
    while(t--){
        solution();
    }
}