补题---892B-Wrath(cf)[2018-3-16]BNUZ套题比赛div2

最新推荐文章于 2020-11-01 22:17:09 发布

mattcat

最新推荐文章于 2020-11-01 22:17:09 发布

阅读量326

点赞数

分类专栏：训练赛补题文章标签：数组

本文链接：https://blog.csdn.net/oranthew/article/details/79660207

版权

训练赛补题专栏收录该内容

2 篇文章 0 订阅

订阅专栏

B - 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.

Example

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

比赛的时候写题太慢，这道题写都没有写，很失败；-；

于是在课后补题时，内心还怀揣着一丝最后的倔强，想着要自己写出来

然而测试数据时频频时间超限，无法通过

万分难过

于是看了一眼别人的答案：哇，真是简单

更加难过了

首先是自己的代码:

#include <stdio.h>
#define MAXN 1000005
int a[MAXN],b[MAXN];
int main()
{
	int n,k,c;
	while(~scanf("%d",&n))
	{
		k=0;
		c=1;
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&a[i]);
			b[i]=1;
			k++;
			if(a[i]>0&&i!=1)
			{
				if(a[i]>=i-1)
				{
					k=1;
					c=i;
					continue;
				}
				for(int j=i-1;j>i-1-a[i]&&j>=c;j--)
				{
					if(k==1)
						break;	
					else if(b[j]==1)
					{
						k--;
						b[j]=0;
					}
				}
			}
		}
		printf("%d\n",k);
	}
}

qaq接下来是别人的：

//忘记是哪来的了（如侵删

#include <stdio.h>
#define MAXN 1000005
int a[MAXN],b[MAXN];
int main()
{
	int n,ans;
	while(~scanf("%d",&n))
	{
	    ans=n;
	    for(int i=1;i<=n;i++)
	    {
		scanf("%d",&a[i]);
	    }
	    int ans=0;  
    	    int tmp=n+1;  
    	    for(int i=n;i>=1;i--)
	    {  
     	        if(i<tmp) ans++;  // 如果当前这个人在上一个人的爪长度攻击范围之外，存活
      	        if(tmp>=i-a[i]) tmp=i-a[i]; // 一轮攻击后当前剩余的人数
    	    }  
	    printf("%d\n",ans);
	}
}