【1093 - Ghajini 线段树】

Server Time:  Sat Aug 11, 2012 10:06 am
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
 
 
 
 
 
下午有比赛。先发一个吧。。。等下再写。。。
 
===========================================================================================================================================
 
 

转载于:https://www.cnblogs.com/ismdeep/archive/2012/08/11/2633445.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值