Problem:
Score : 400 points

Problem Statement

There are N towns located in a line, conveniently numbered 1 through N. Takahashi the merchant is going on a travel from town 1 to town N, buying and selling apples.

Takahashi will begin the travel at town 1, with no apple in his possession. The actions that can be performed during the travel are as follows:

Move: When at town i (i < N), move to town i + 1.

Merchandise: Buy or sell an arbitrary number of apples at the current town. Here, it is assumed that one apple can always be bought and sold for A_i yen (the currency of Japan) at town i (1 ≦ i ≦ N), where A_i are distinct integers. Also, you can assume that he has an infinite supply of money.

For some reason, there is a constraint on merchandising apple during the travel: the sum of the number of apples bought and the number of apples sold during the whole travel, must be at most T. (Note that a single apple can be counted in both.)

During the travel, Takahashi will perform actions so that the profit of the travel is maximized. Here, the profit of the travel is the amount of money that is gained by selling apples, minus the amount of money that is spent on buying apples. Note that we are not interested in apples in his possession at the end of the travel.

Aoki, a business rival of Takahashi, wants to trouble Takahashi by manipulating the market price of apples. Prior to the beginning of Takahashi's travel, Aoki can change A_i into another arbitrary non-negative integer A_i' for any town i, any number of times. The cost of performing this operation is |A_i - A_i'|. After performing this operation, different towns may have equal values of A_i.

Aoki's objective is to decrease Takahashi's expected profit by at least 1 yen. Find the minimum total cost to achieve it. You may assume that Takahashi's expected profit is initially at least 1 yen.

Constraints

1 ≦ N ≦ 10^5

1 ≦ A_i ≦ 10^9 (1 ≦ i ≦ N)

A_i are distinct.

2 ≦ T ≦ 10^9

In the initial state, Takahashi's expected profit is at least 1 yen.

Input

The input is given from Standard Input in the following format:

N T
A_1 A_2 ... A_N

Output

Print the minimum total cost to decrease Takahashi's expected profit by at least 1 yen.

Sample Input 1

3 2
100 50 200

Sample Output 1

1

In the initial state, Takahashi can achieve the maximum profit of 150 yen as follows:

Move from town 1 to town 2.

Buy one apple for 50 yen at town 2.

Move from town 2 to town 3.

Sell one apple for 200 yen at town 3.

If, for example, Aoki changes the price of an apple at town 2 from 50 yen to 51 yen, Takahashi will not be able to achieve the profit of 150 yen. The cost of performing this operation is 1, thus the answer is 1.

There are other ways to decrease Takahashi's expected profit, such as changing the price of an apple at town 3 from 200 yen to 199 yen.

Sample Input 2

5 8
50 30 40 10 20

Sample Output 2

2

Sample Input 3

10 100
7 10 4 5 9 3 6 8 2 1

Sample Output 3

2

Solution in C (GCC 5.4.1) (judge verdict: Accepted)

#include <stdio.h>
#include <stdlib.h>

int cmp(const void* x, const void* y) {
	int a = *(const int*)x, b = *(const int*)y;
	if (a < b) return -1;
	return a > b;
}

int N, T;
int A[114514];

int sorted[114514];
char visited[114514];

int get_id(int num) {
	int left = 0, right = N - 1;
	while (left <= right) {
		int mid = left + (right - left) / 2;
		if (sorted[mid] == num) return mid;
		else if (sorted[mid] < num) left = mid + 1;
		else right = mid - 1;
	}
	return -1;
}

int main(void) {
	int i;
	int min_price, max_rieki = 0;
	int answer = 0;
	if (scanf("%d%d", &N, &T) != 2) return 1;
	for (i = 0; i < N; i++) {
		if (scanf("%d", &A[i]) != 1) return 1;
		sorted[i] = A[i];
	}
	if (N < 0) {
		puts("NO TOWNS");
		return 1;
	}
	qsort(sorted, N, sizeof(*sorted), cmp);

	/* max利益を求める */
	min_price = A[0];
	for (i = 0; i < N; i++) {
		if (A[i] < min_price) min_price = A[i];
		if (A[i] - min_price > max_rieki) max_rieki = A[i] - min_price;
	}

	/* 高値に対して対応する安値があるかをチェックしてカウントする */
	for (i = 0; i < N; i++) {
		int this_id = get_id(A[i]);
		int yasune_id = get_id(A[i] - max_rieki);
		if (yasune_id >= 0 && visited[yasune_id]) answer++;
		visited[this_id] = 1;
	}
	printf("%d\n", answer);

	return 0;
}

/*

最安の所で買って一番高い所で売るのが一番儲かる (全部ぶっこむ)
青木君はこのdiffがmaxの所を全て潰せばよい

買→売のペアが交差することは考えなくていい (前の買→後ろの売を使えばいいはずなので)
買(このとき必然的に売も)の価格が同じ時に注意

→二部グラフの最小点被覆

二部グラフの最小点被覆、最大安定集合 (最大独立集合)、最小辺被覆を総整理！ - Qiita
https://qiita.com/drken/items/7f98315b56c95a6181a4

二部グラフの最小点被覆と最大安定集合と最小辺被覆の求め方
https://www.slideshare.net/drken1215/ss-86894312

→答えは最大マッチングサイズ

1 2 1 2 1 2 … のようなケースだと辺の数がでかくてヤバい！
→ 「Aiは相異なる」という条件があるので多分大丈夫やろ
→ ということは、「買(このとき必然的に売も)の価格が同じ時」も無いやんけ

→ 高値に対応してmax利益を生む安値があるかをチェックしてカウントでおｋ

*/