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:
- 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·105). In the next line there are n space-separated integers b1, b2, ..., bn (1 ≤ bi ≤ 109).
The only line of output should contain two integers. The maximum beauty difference and the number of ways this may happen, respectively.
2 1 2
1 1
3 1 4 5
4 1
5 3 1 2 3 1
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.
解析:一列数中,选出差值最大的两个组合,并且最大的组合有多少情况。
差值最大当然是最大值减去最小值了,只需要排个序即可,结果就等于最大值的个数乘以最小值的个数。
PS:当最大值等于最小值时,即此时所有数字全相等,这时的ans = n * (n-1) / 2.
AC代码:
#include <bits/stdc++.h>
using namespace std;
long long a[200005];
int main(){
// freopen("in.txt", "r", stdin);
int n;
while(~scanf("%d", &n)){
for(int i=0; i<n; i++) scanf("%lld", &a[i]);
sort(a, a+n);
if(a[0] == a[n-1]) cout<<0<<" "<<((long long)n * (n - 1)) / 2<<endl;
else printf("%lld %lld\n", a[n-1] - a[0], (long long)(upper_bound(a, a+n, a[0]) - lower_bound(a, a+n, a[0])) * (upper_bound(a, a+n, a[n-1]) - lower_bound(a, a+n, a[n-1])));
}
return 0;
}