Submission #919661

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
using namespace std;
typedef pair<int, int> P;

signed main(){
	int n;
	cin >> n;
	vector<int> a(n);
	rep(i, 0, n) cin >> a[i];
	int now = 1, id = 0, MAX = 1, ans = 0;
	rep(i, 0, n){
		if(a[i] > now){
			ans += (a[i] - 1) / now;
		}else{
			MAX = max(MAX, a[i]);
		}
		if(now <= MAX) now = MAX + 1;
	}
	cout << ans << endl;
}

Submission Info

Judge Result