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.
题目大意:
给出n朵花,每一朵花有它的颜值b[i],Parmida想要两朵花,并且两朵花的颜值差距最大。要求求出颜值最大差距,和组合个数。
解法:
排个序,就可以求出最大颜值差,同时可以统计最高颜值的朵数x和最低颜值的朵数y,组合个数等于x*y。这里需要注意一种特例,就是所有颜值都一样,差距为0,组合个数为n*(n-1)/2。
代码:
#include <cstdio>
#include <iostream>
#include <algorithm>
#define N_max 2*123456
#define LL long long
using namespace std;
LL n;
int a[N_max];
void init() {
cin >> n;
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
sort(a+1, a+n+1);
}
void solve() {
printf("%d ", a[n]-a[1]);
if (a[n] == a[1]) {
cout << n*(n-1)/2 << endl;
return;
}
LL x=1;
for (int i = 2; i <= n; i++)
if (a[i] == a[1])
x++;
else
break;
LL y=1;
for (int i = n-1; i >= 1; i--)
if (a[i] == a[n])
y++;
else
break;
cout << x*y << endl;
}
int main() {
init();
solve();
}