CodeForces 459B Pashmak and Flowers
来源:互联网 发布:网络知识培训手机 编辑:程序博客网 时间:2024/04/30 09:02
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.
The first line of the input contains n (2 ≤ n ≤ 2·105). In the next line there aren space-separated integersb1, 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.
21 2
1 1
31 4 5
4 1
53 1 2 3 1
2 4
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<algorithm> #define K 200010 using namespace std; long long int b[K];int main(){ long long int n,i,hi,a,k;while(cin>>n){a=k=0;for(i=0;i<n;i++){cin>>b[i];}sort(b,b+n);hi=b[n-1]-b[0];if(b[n-1]!=b[0]){for(i=0;i<n;i++){if(b[i]==b[0]){a++;}else{break;}}for(i=n-1;i>=0;i--){if(b[i]==b[n-1]){k++;}else{break;}}cout<<hi<<" "<<a*k<<endl;}else{cout<<hi<<" "<<n*(n-1)/2<<endl;}} return 0; }
- 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】 B. Pashmak and Flowers
- 459B Pashmak and Flowers
- codeforces—— 459B —— Pashmak and Flowers
- B. Pashmak and Flowers
- B. Pashmak and Flowers
- B. 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
- Codeforces Round #261 (Div. 2)B. Pashmak and Flowers
- Codeforces Round #261 (Div. 2) B. Pashmak and Flowers 水题
- web资源访问流程
- LeetCode106—Construct Binary Tree from Inorder and Postorder Traversal
- python之false和None
- 300.LeetCode Longest Increasing Subsequence(medium)[动态规划]
- Java温习
- CodeForces 459B Pashmak and Flowers
- java SE基础(Collection接口概述)
- Java内存分析工具——Jstat
- plsql developer连接数据库时出现ORA-01033错误的解决方法
- Collection--Map
- LeetCode 338. Counting Bits
- 14.LeetCode Longest Common Prefix(easy)[字符串公共前缀]
- 通俗易懂的机器学习入门指导
- Dubbo框架结构