【CodeForces】716A - Crazy Computer（水）

最新推荐文章于 2019-07-19 22:44:00 发布

原创最新推荐文章于 2019-07-19 22:44:00 发布 · 751 阅读

0 ·

CC 4.0 BY-SA版权

水题专栏收录该内容

93 篇文章

订阅专栏

本文介绍了一种特殊的电脑设定：若连续输入间隔超过特定秒数，所有已输入内容将被清除。文章通过示例详细解释了该设定的工作原理，并提供了一个简单的算法实现，用于计算在一系列输入时间点下最终屏幕上的单词数量。

点击打开题目

ZS the Coder is coding on a crazy computer. If you don't type in a word for a c consecutive seconds, everything you typed disappear!

More formally, if you typed a word at second a and then the next word at second b, then if b - a ≤ c, just the new word is appended to other words on the screen. If b - a > c, then everything on the screen disappears and after that the word you have typed appears on the screen.

For example, if c = 5 and you typed words at seconds 1, 3, 8, 14, 19, 20 then at the second 8 there will be 3 words on the screen. After that, everything disappears at the second 13 because nothing was typed. At the seconds 14 and 19 another two words are typed, and finally, at the second 20, one more word is typed, and a total of 3 words remain on the screen.

You're given the times when ZS the Coder typed the words. Determine how many words remain on the screen after he finished typing everything.

Input

The first line contains two integers n and c (1 ≤ n ≤ 100 000, 1 ≤ c ≤ 109) — the number of words ZS the Coder typed and the crazy computer delay respectively.

The next line contains n integers t1, t2, ..., tn (1 ≤ t1 < t2 < ... < tn ≤ 109), where ti denotes the second when ZS the Coder typed the i-th word.

Output

Print a single positive integer, the number of words that remain on the screen after all n words was typed, in other words, at the secondtn.

   Examples
 
     input
   
6 5
1 3 8 14 19 20

     output
   
3

     input
   
6 1
1 3 5 7 9 10

     output
   
2

Note

The first sample is already explained in the problem statement.

For the second sample, after typing the first word at the second 1, it disappears because the next word is typed at the second 3 and3 - 1 > 1. Similarly, only 1 word will remain at the second 9. Then, a word is typed at the second 10, so there will be two words on the screen, as the old word won't disappear because 10 - 9 ≤ 1.

把题读懂就是水题了。题目是说打下下一个字母的时候，如果和之前字母打下的时间不超过k的话，则保留前面的继续打，如果超过了，则前面的字母全部消失，只留下这一个字母。

代码如下：

#include <cstdio>
#include <stack>
#include <queue>
#include <cmath>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
#define CLR(a,b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define LL long long
int main()
{
	int n,k;
	int ant;
	int num[100005];
	scanf ("%d %d",&n,&k);
	for (int i = 1 ; i <= n ; i++)
		scanf ("%d",&num[i]);
	ant = 1;
	for (int i = 2 ; i <= n ; i++)
	{
		if (num[i] - num[i-1] <= k)
			ant++;
		else
			ant = 1;
	}
	printf ("%d\n",ant);
	return 0;
}