Submission #919114

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vii;
typedef vector<ll> vll;

#define X first
#define Y second
#define rep(i,n) for(ll i=0; i<(n); i++)
#define repp(i,ed,b) for(ll i=ed; i<=(b); i++)
#define repp2(i,b,ed) for(ll i=b; i>=(ed); i--)
#define fill(ed,val) memset(ed, (val), sizeof(ed))
#define mp make_pair
#define pb push_back
#define sz(x) (ll)x.size()
#define all(c) (c).begin(), (c).end()
#define uni(c) c.resize(distance(c.begin(), unique(all(c))))
#define io ios_base::sync_with_stdio(false);cin.tie(NULL);
#define sc(n) scanf("%lld",&n)

ll mod= 1e9 + 7, mod1=1e9+9;
const ll N=1000005,MAX=2e9+5;



int main()
{   
    io;
    
    
    ll n;
    cin>>n;
    ll a[N],ans=0;;
    rep(i,n)cin>>a[i];
    set<ll> my;
    my.insert(0);
    rep(i,n){
        ll x=*(my.rbegin());
        x++;
        ll tmp=(a[i]-1)/x;
        //cout<<x<<' '<<tmp<<' ';
        ans+=tmp;
        
        tmp=(a[i]-1)%min(x,tmp==0?x:tmp)+1;
        //cout<<tmp<<endl;
        my.insert(tmp);
    }
    cout<<ans;
    
    return 0;
}

Submission Info

Judge Result