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.
OutputPrint one integer — the total number of alive people after the bell rings.
Examples4 0 1 0 10
1
2 0 0
2
10 1 1 3 0 0 0 2 1 0 3
3
In first sample the last person kills everyone in front of him.
题意:一共n个人站成一排,每人手里都有一把长度为Li的剑,某一时刻大家同时向前捅,求最后剩几个活人思路:最右边的人肯定可以活,从后向前递推,求到达第i个人是剑的长度,如果大于0,则挂在剑下~~~代码:
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 1e6+10;
int arr[N];
int main(){
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&arr[i]);
int ans=1,len=arr[n-1];
for(int i=n-2;i>=0;i--){
if(!len) ans++;
len=max(len-1,arr[i]);
}
printf("%d\n",ans);
return 0;
}