Wrath CodeForces - 892B

最新推荐文章于 2019-03-28 14:28:14 发布

Learning_is_endless

最新推荐文章于 2019-03-28 14:28:14 发布

阅读量163

点赞数

分类专栏： # 贪心

本文链接：https://blog.csdn.net/zhangxiaoduoduo/article/details/80069789

版权

贪心专栏收录该内容

7 篇文章 0 订阅

订阅专栏

Wrath

CodeForces - 892B

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

Input

2
0 0

Output

Input

10
1 1 3 0 0 0 2 1 0 3

Output

Note

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

题意：共n个人，攻击范围为a[i],只能攻击前一个人，当铃声响起，所有人同时开始攻击，问最后剩几个人。

思路: 从后向前贪心

AC代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#define maxn 1000010
#define INF 0x3f3f3f3f
#define LL long long
using namespace std;
LL l[maxn];
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%I64d",&l[i]);
    }
    int ans=0;
    int indx=n+1;
    for(int i=n;i>=1;i--){
        //cout<<i<<endl;
        if(i<indx){
            ans++;
            //cout<<i<<endl;
        }
        int x=i-l[i];
        if(x<=0) x=1;
        if(indx>x) indx=x;
    }
    printf("%d\n",ans);
    return 0;
}