Codeforces #459 B

Written by    15:55 August 16, 2014 

Codeforces #459 B

B. Pashmak and Flowers
time limit per test

1 second

memory limit per test

256 megabytes


standard input


standard output

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.

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.

Sample test(s)







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.

这个题其实就是记录数组的最大值和最小值的个数, 注意输出结果的数值范围要给够, 还有就是如果所有的数字都相等的话应该输出n-1的累和, 即1+2+3+4+…+n-1

By 何孟海

Category : acmstudy

Tags :