#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <deque>
#include <cctype>
using namespace std;
typedef long long LL;
const int inf = 1e9;
const double eps = 1e-8;
LL n, ans1, ans2;
vector<int> v;
void init()
{
ans1 = ans2 = 0;
v.clear();
v.resize(n);
for (int i = 0; i < n; ++i) {
scanf("%d", &v[i]);
}
}
void solve()
{
sort(v.begin(), v.end());
ans1 = v[n - 1] - v[0];
LL tmp1 = count(v.begin(), v.end(), v[0]);
LL tmp2 = count(v.begin(), v.end(), v[n - 1]);
if (v[0] == v[n - 1]) ans2 = n * (n - 1) / 2;
else ans2 = tmp1 * tmp2;
}
void print()
{
cout << ans1 << " " << ans2 << endl;
}
int main()
{
while (cin >> n) {
init();
solve();
print();
}
return 0;
}
Codeforces Round #261 (Div. 2)B. Pashmak and Flowers
最新推荐文章于 2022-11-22 23:15:14 发布