zoukankan      html  css  js  c++  java
  • 【1093 Ghajini 线段树】

    1093 - Ghajini
    Time Limit: 1 second(s) Memory Limit: 32 MB

    Amir is having a short term memory problem. He can't remember anything for more than d milliseconds.

    Amir is playing a game named 'Find Max Difference'. The game is actually designed for children. There is a screen which shows an integer for 1 millisecond. In the very next millisecond the screen shows another integer. The target of the game is to find the maximum difference of any two numbers shown in the screen.

    But soon Amir found that the game is more difficult for him, because his short term memory problem. So, he uses a paper to write the maximum difference he has found so far. So, Amir wants your help. You have to write a program to help Amir.

    Input

    Input starts with an integer T (≤ 5), denoting the number of test cases.

    Each case starts with two integers n (2 ≤ n ≤ 105)d (1 ≤ d ≤ n)n means the total number of integers the screen will show. The next line contains n space separated integers in range [0, 108].

    Output

    For each case, print the case number and the maximum difference found by Amir.

    Sample Input

    Output for Sample Input

    3

    6 2

    6 0 8 8 8 4

    8 3

    19 8 4 13 12 1 0 13

    2 2

    1 1

    Case 1: 8

    Case 2: 15

    Case 3: 0

    Notes

    Dataset is huge, use faster I/O methods.


    PROBLEM SETTER: JANE ALAM JAN
    Developed and Maintained by 
    JANE ALAM JAN
    Copyright © 2012 
    LightOJ, Jane Alam Jan
     
     
     
     
     
    下午有比赛。先发一个吧。。。等下再写。。。
     
    ===========================================================================================================================================
     
     
  • 相关阅读:
    暑假日报-35
    非确定性有穷状态决策自动机练习题Vol.1 题解 & 总结
    loj数列分块入门 1~9
    第12周作业
    第二阶段考试
    UOJ NOI Round 4
    事件
    爬楼梯
    构造函数输出
    比较版本号大小
  • 原文地址:https://www.cnblogs.com/ismdeep/p/2633445.html
Copyright © 2011-2022 走看看