Codeforces Round #261 (Div. 2) B

Description

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 bi. 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:

1. The maximum beauty difference of flowers that Pashmak can give to Parmida.
2. 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.

Input

The first line of the input contains n (2 ≤ n ≤ 2·105). In the next line there are n space-separated integers b1, b2, ..., bn (1 ≤ bi ≤ 109).

Output

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

Examples

input

2
1 2

output

1 1

input

3
1 4 5

output

4 1

input

5
3 1 2 3 1

output

2 4

Note

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

1. choosing the first and the second flowers;
2. choosing the first and the fifth flowers;
3. choosing the fourth and the second flowers;
4. choosing the fourth and the fifth flowers.

题意：求花的最大差值，以及选取两种花能组成最大差值的有多少方法

解法：当然是记录最大最小之差，至于求选取方法，我们统计最大有多少，最小有多少，乘一下

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 map<int,int>q;
 4 int main()
 5 {
 6     int Max=-1,Min=(1<<31)-1;
 7     long long n;
 8     cin>>n;
 9     for(int i=1;i<=n;i++)
10     {
11         int num;
12         cin>>num;
13         Max=max(num,Max);
14         Min=min(Min,num);
15         q[num]++;
16     }
17     if(q.size()==1)
18     {
19         cout<<"0"<<" "<<n*(n-1)/2<<endl;
20     }
21     else
22     {
23         cout<<Max-Min<<" "<<(long long)q[Min]*q[Max]<<endl;
24     }
25    // cout<<Max-Min<<" "<<q[Max]*q[Min]<<endl;
26     return 0;
27 }

 

转载于:https://www.cnblogs.com/yinghualuowu/p/6581980.html