打破循环条件不可变

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int a[1000005],b[1000005];
int main()
{
    int n;
    scanf("%d",&n);
    for (int i = n;i > 0;i --)
        scanf("%d",&a[i]);

    // -1表示死亡，0活着
    for (int i = 1;i <= n;i ++){
        //  处决时刻 来吧
        int j = min(a[i]+i,n);
        for (int k = i+1;k <= j;k ++){
            b[k] = -1;
            j = min(n,max(k+a[k],j));
            i = k;
        }
    }

    int counter = 0;
    for (int i = 1;i <= n;i ++)
        if (b[i] == 0)counter ++;
    printf("%d\n",counter);
    return 0;
}

循环条件，可变

B. Wrath

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Hands that shed innocent blood!

There are n guilty people in a line, the i-th of them holds a claw with length L_i. The bell rings and every person kills some of people in front of him. All people kill others at the same time. Namely, the i-th person kills the j-th person if and only if j < i and j ≥ i - L_i.

You are given lengths of the claws. You need to find the total number of alive people after the bell rings.

Input

The first line contains one integer n (1 ≤ n ≤ 10⁶) — the number of guilty people.

Second line contains n space-separated integers L₁, L₂, ..., L_n (0 ≤ L_i ≤ 10⁹), where L_i is the length of the i-th person's claw.

Output

Print one integer — the total number of alive people after the bell rings.

Examples

Input

4
0 1 0 10

Output

1

Input

2
0 0

Output

2

Input

10
1 1 3 0 0 0 2 1 0 3

Output

3