Codeforces 716A A. Crazy Computer

最新推荐文章于 2021-07-28 15:30:12 发布

原创最新推荐文章于 2021-07-28 15:30:12 发布 · 422 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Codeforces

Codeforces 专栏收录该内容

5 篇文章

订阅专栏

本文介绍了一个关于在特殊电脑上打字的问题，该电脑会在连续输入间隔超过一定时间后清除所有已输入的内容。文章详细解释了如何计算在一系列输入时间点后屏幕上剩余单词的数量，并通过示例展示了这一过程。

A. Crazy Computer
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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 second tn.

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 and 3 - 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.

n,c = map(int, raw_input().split())
ans = 1
a = map(int, raw_input().split())
for i in range(1,n):
    if a[i]-a[i-1] <= c:
        ans += 1
    else:
        ans = 1
print ans