Descr iption



给定整型数组A（长度为），如果A的某个连续子数组满足：最大值与最小值之差小于某阈值，那么称该子数组为合法子数组，反之称为非法子数组。求最短非法子数组和最长合法子数组。



Input Descr iption





第一行：整型数，表示数组长度N。



第二行：整型数，表示阈值。



第三行：整型数组，表示给定的数组A，每两个整数之间用空格符分开。



Output Descr iption





第一行：最短非法子数组的长度（如果不存在，则输出0）。



第二行：最长合法子数组的长度（如果不存在，则输出0）。

-Descr iption given integer array A (length), if a continuous subarray meet A: The difference between maximum and minimum values ​ ​ of less than a certain threshold, then said the sub-sub-array is an array of legal, otherwise known as illegal sub-array. The shortest and longest illegal sub-arrays legitimate child array. Input Descr iption First line: integer representing the array length N. Second row: integer number that represents a threshold value. Third row: integer array representing the given array A, between each two integers separated by a space character. Output Descr iption First line: the length of the shortest illegal sub-array (if not present, the output 0). Second row: maximum length legitimate child of the array (if not present, the output 0).