void solve() {
    int n;
    cin >> n;
    vector<int> s(n);
    cin >> s;
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        ans += s[i] - 1;
        s[i] = min(s[i], n - i);
        while (s[i] != 1) {
            int k = i;
            while (k + s[k] < n) {
                s[k]--;
                k += s[k] + 1;
            }
        }
    }
    cout << ans << "\n";
}