zoukankan      html  css  js  c++  java
  • Crazy Computer

    ZS the Coder is coding on a crazy computer. If you don't type in a word for a cconsecutive 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 3words 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 tidenotes 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.

    Example

    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.



    时间间隔超过c就会清除,问最后剩下几个数。

    代码:

    #include <iostream>
    #include <map>
    #include <algorithm>
    using namespace std;
    int main()
    {
        int n,c;
        cin>>n>>c;
        int d;
        if(n)cin>>d;
        int t = d;
        int counti = 1;
        for(int i = 1;i < n;i ++)
        {
            cin>>d;
            if(d - t > c)counti = 1;
            else counti ++;
            t = d;
        }
        cout<<counti;
    }
  • 相关阅读:
    717 汉诺塔的非递归实现 (25分)
    JSP入门[续]
    JSP运行原理和九大隐式对象
    JSP入门
    Mysql基本命令
    DataGridView数据导出为Excel
    sql server 2005中如何添加外键
    自定义配置文件的读取
    WinForm(C#)CheckedlistBox绑定数据,并获得选中的值(ValueMember)和显示文本(DisplayMember
    No CurrentSessionContext configured Hibernate
  • 原文地址:https://www.cnblogs.com/8023spz/p/7668493.html
Copyright © 2011-2022 走看看