提出 #75639012

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define all(x) (x).begin(), (x).end()
#define pb push_back

template<class T> inline bool chmax(T& a, T b) { return a < b ? a = b, 1 : 0; }
template<class T> inline bool chmin(T& a, T b) { return a > b ? a = b, 1 : 0; }

const int MOD = 1e9 + 7;

void solve() {
    
    ll n,k;cin>>n>>k;
    vector<ll> a(n+1);
    for(int i=0;i<n;i++)cin>>a[i];
    //c lassic binary seach;
    auto check=[&](ll mid)->bool{
        ll ops=0;
        for(int i=0;i<n;i++){
            if(a[i]>=mid)continue;
            ll diff=mid-a[i]    ;
            ll op=(diff+i)/(i+1);
            ops+=op;
            if(ops>k)   return false;
        }
        return 1;

    };
    ll l=*min_element(all(a)),h=2e18;
    ll ans=l;
    while(l<=h){
        ll mid=l+(h-l)/2;
        if(check(mid)){
            l=mid+1;
            ans=mid;
        }else h=mid-1;
    }
    cout<<ans<<'\n';

    
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int tt = 1;
    //cin>>tt;
    while (tt--) {
        solve();
    }

    return 0;
}

提出情報

ジャッジ結果