Pashmak and Flowers
2016-01-01 11:55
281 查看
Description
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.
Input
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).
Output
The only line of output should contain two integers. The maximum beauty difference and the number of ways this may happen, respectively.
Sample Input
Input
Output
Input
Output
Input
Output
Hint
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.
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.
Input
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).
Output
The only line of output should contain two integers. The maximum beauty difference and the number of ways this may happen, respectively.
Sample Input
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
Hint
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.
#include<iostream> #include<cstdio> #include<algorithm> #define K 200010 using namespace std; int a[K],mx,mi; int main(){ long long int n,b,c,ans; cin>>n; b=0; c=0; mx=1; mi=10e9; for(int i=0;i<n;i++){ cin>>a[i]; mi=min(a[i],mi); mx=max(a[i],mx); } for(int i=0;i<n;i++){ if(a[i]==mx){ b++; } if(a[i]==mi){ c++; } } if(mi==mx){ ans=n*(n-1)/2; } else{ ans=b*c; } cout<<mx-mi<<" "<<ans<<endl; return 0; }
相关文章推荐
- 月光微博客
- 两个链表的合并
- ACCESS网站示例-连载-首页设计
- 在Linux下通过命令行来操作使用Dropbox
- 计算机组成原理-指令系统
- helloword
- Activity界面
- 电工助手 V1.2
- Two Sum III - Data structure design
- 批量创建&删除用户
- ACE Reactor FrameWork使用注意事项
- <5>噪点 信噪比
- 如何成为一个好的程序员(2)
- 检查局域网存活主机
- zzuoj--10401--物资调度(dfs)
- (6)uboot详解——关闭缓存和mmu
- 最长子列和问题 在线处理法
- 开始学习Shell/bash 加减乘运算
- zzuoj--10401--物资调度(dfs)
- 老友记一路相伴---2015年12月英语月总