Codeforces 459B Pashmak and Flowers

题目链接：http://codeforces.com/problemset/problem/459/B

 

B. Pashmak and Flowers

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

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 b_i. 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·10⁵). In the next line there are n space-separated integers b₁, b₂, ..., b_n (1 ≤ b_i ≤ 10⁹).

Output

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

 

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

大致题意：一个人买两支花，然后要这两支花的漂亮程度差最大，并且问产生这种最大差值的情况有几种，输出最大的差值，和有几种。（坑点就是  如果花朵美丽程度都相等 得另外特判一下）。
#include <stdio.h>
#include <algorithm>
using namespace std;
int main()
{
    int n ;
    int num[200010];
    while ( ~scanf("%d",&n ) )
    {
        for ( int i = 0 ; i < n ; i++ )
        {
            scanf("%d",&num[i]);
        }
        sort(num,num+n);
        __int64 cou1 = 1 ,cou2 = 1;
        for (int i = 0 ; i < n-1 ; i++ )
        {
            if(num[i] == num[i+1] )
            {
                cou1++;
                continue;
            }
                break;
        }
        for (int i = n-1 ; i >=1 ; i-- )
        {
            if(num[i] == num[i-1] )
            {
                cou2++;
                continue;
            }
                break;
        }
        //printf("%d\n",cou1);
        if ( cou1 == n)
        {
            printf("%d %I64d\n",num[n-1]-num[0],cou1*(cou1-1)/2);
        }
        else if ( cou1 != n)
            printf("%d %I64d\n",num[n-1]-num[0],cou1*cou2);
    }
    return 0;
}

</pre><p></p>