CodeForces - 892B Wrath

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.

Example

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

Note

In first sample the last person kills everyone in front of him.

不断地更新杀人的最大区间。然后哈哈哈~~~

#include<stdio.h>
#include<algorithm>
using namespace std;
int n;
int a[1000100];
int main()
{
    while(~scanf("%d",&n))
    {
        for(int i=0;i<n;i++)
            scanf("%d",&a[i]);
        int l=a[n-1];
        int pos=n-1-a[n-1];
        if(l>(n-1))//如果长度大于人数，呵呵
        {
            l=n-1;
            pos=0;
        }
        for(int i=n-1;i>=0;i--)
        {
             int t=i-a[i];//  能杀到人的位置
             if(t<0)
                t=0;
            if(t<pos)
            {
                if(i>=pos)//分析t比pos更靠左，i在pos左或右两种情况
                {
                    l=pos-t+l;
                }
                else
                {
                    l=l+i-t;
                }
                pos=t;
            }
        }
        printf("%d\n",n-l);
    }
    return 0;
}

转载于:https://www.cnblogs.com/zitian246/p/9123604.html