B - Wrath(思维）

Hands that shed innocent blood!

There are n guilty people in a line, the i-th of them holds a claw with length Li. 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 - Li.

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 ≤ 106) — the number of guilty people.

Second line contains n space-separated integers L1, L2, …, Ln (0 ≤ Li ≤ 109), where Li 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

题解：

这题的暴力解法应该是用一个vis数组，O(n2)，一开始一直想用set，还是太菜。
参考别人的解法。
O(n)
首先翻转这个数组，每次取now的最大值，往后扫就行。每次记录i<=now.

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int maxn = 1e6+100;

int L[maxn];
bool vis[maxn];

int main()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&L[i]);
    }
    reverse(L+1,L+1+n);
    memset(vis,false,sizeof(vis));
    int now = L[1]+1;
    for(int i=2;i<=n;i++)
    {
        if(i<=now) vis[i]=true;
        now = max(now,i+L[i]);
    }
    int ans=0;
    for(int i=1;i<=n;i++)
    {
        if(!vis[i]) ans++;
    }
    cout<<ans<<endl;
    return 0;
}