Pashmak and Flowers(模拟)

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 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.
Input

The first line of the input contains n (2 ≤ n ≤ 2·105). In the next line there are n space-separated integers b1b2, ..., bn (1 ≤ bi ≤ 109).

Output

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)
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
Note

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 个数,找出最大的相差值,还有输出构成这个最大相差数的方法数。

 

     思路:

     模拟。sort 一遍之后直接找头尾两部分即可,记得输出答案要用 long long。

 

     AC:

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

typedef long long ll;

int num[200005];

int main() {

    int n;
    scanf("%d", &n);

    for (int i = 0; i < n; ++i)
        scanf("%d", &num[i]);

    sort(num, num + n);

    printf("%d ", num[n - 1] - num[0]);

    ll ans1 = 0;
    int from;
    for (int i = n - 1; i >= 0; --i) {
        if (num[i] == num[n - 1]) {
            ++ans1;
            from = i;
        } else break;
    }


    ll ans2 = 0;
    int to;
    for (int i = 0; i < n; ++i) {
        if (num[i] == num[0]) {
            ++ans2;
            to = i;
        } else break;
    }

    if (to == n - 1) printf("%I64d\n", (ll)n * (n - 1) / 2);
    else printf("%I64d\n", ans1 * ans2);

    return 0;
}

 

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值