Pashmak and Flowers
来源:互联网 发布:ubuntu 内存使用情况 编辑:程序博客网 时间:2024/06/06 12:51
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 numberbi. 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 aren 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
21 2
1 1
31 4 5
4 1
53 1 2 3 1
2 4
Hint
In the third sample the maximum beauty difference is 2 and there are4 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 200010using 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;}
- B. Pashmak and Flowers
- cf459B Pashmak and Flowers
- B. Pashmak and Flowers
- B. Pashmak and Flowers
- Pashmak and Flowers
- 459B Pashmak and Flowers
- 【CODEFORCES】 B. Pashmak and Flowers
- #261B. Pashmak and Flowers
- Codeforces 459B Pashmak and Flowers(水题)
- CodeForces 459B. Pashmak and Flowers
- Codeforces 459B Pashmak and Flowers
- CodeForces 459B Pashmak and Flowers
- codeforces 459B Pashmak and Flowers
- Codeforces Round #261 (Div. 2)B. Pashmak and Flowers
- Codeforces #261 (Div. 2)B. Pashmak and Flowers
- Codeforces Round #261 (Div. 2) B.Pashmak and Flowers
- Codeforces Round #261 (Div. 2) B. Pashmak and Flowers【水】
- Codeforces Round #261 (Div. 2) B. Pashmak and Flowers
- Web Service中使用HTTP和JMS
- 批量创建&删除用户
- python 数据结构常用的模块
- CALayer - 2
- 计算机组成原理-指令系统
- Pashmak and Flowers
- MAC上安装、配置openfile服务器(ios即时通讯)
- ACE_Mesaage_Block,ACE_InputCdr,ACE_OutputCdr的使用
- Android Animation学习(一) Property Animation介绍
- 数据备份与还原
- Linux CentOS 7编译redis报错"cc:未找到命令"解决方案
- Genymotoin模拟器调试出现 Fatal signal 11 (SIGSEGV) at 0x000000b4 (code=1)
- php webshell的防范
- sed & gawk