CF459B.Pashmak and Flowers

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Pashmak decided to give Parmida a pair of flowers from the garden. There are $n$ flowers in the garden and the $i$ -th of them has a beauty number $b_{i}$ . Parmida is a very strange girl so she doesn't want to have the two most beautiful flowers necessarily. She wants to have those pairs of flowers that their beauty difference is maximal possible!

Your task is to write a program which calculates two things:

The maximum beauty difference of flowers that Pashmak can give to Parmida.
The number of ways that Pashmak can pick the flowers. Two ways are considered different if and only if there is at least one flower that is chosen in the first way and not chosen in the second way.

输入格式

The first line of the input contains $n$ $(2<=n<=2·10^{5})$ . In the next line there are $n$ space-separated integers $b_{1}$ , $b_{2}$ , ..., $b_{n}$ $(1<=b_{i}<=10^{9})$ .

输出格式

The only line of output should contain two integers. The maximum beauty difference and the number of ways this may happen, respectively.

输入输出样例

输入#1
```
2
1 2
```
输出#1
```
1 1
```
输入#2
```
3
1 4 5
```
输出#2
```
4 1
```
输入#3
```
5
3 1 2 3 1
```
输出#3
```
2 4
```

说明/提示

In the third sample the maximum beauty difference is $2$ and there are $4$ ways to do this:

choosing the first and the second flowers;
choosing the first and the fifth flowers;
choosing the fourth and the second flowers;
choosing the fourth and the fifth flowers.

首页