Codeforces Round #261 (Div. 2) B. Pashmak and Flowers
来源:互联网 发布:unity3d 烘焙 编辑:程序博客网 时间:2024/05/18 03:32
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 integers b1,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 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.
题目意思:有 n 朵 flowers,每朵flower有相应的 beauty,求出最大的beauty 差 和 要达到这个最大的差 的取法有多少种。
#include <stdio.h>#include <string.h>#include <stdlib.h>#include <limits.h>#include <math.h>#include <iostream>#include <algorithm>using namespace std;int main(){long long maxnum=INT_MIN,minnum=INT_MAX,maxcnt,mincnt;int n,tmp;scanf("%d",&n);for(int i=0;i<n;i++){scanf("%d",&tmp);if(tmp>maxnum){maxnum=tmp;maxcnt=1;}else if(tmp==maxnum)maxcnt++;if(tmp<minnum){minnum=tmp;mincnt=1;}else if(tmp==minnum)mincnt++;}long long delta=maxnum-minnum;long long idea;if(delta==0)idea=maxcnt*(maxcnt-1)/2;elseidea=maxcnt*mincnt;printf("%I64d %I64d\n",delta,idea);return 0;}
- 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
- Codeforces Round #261 (Div. 2) B. Pashmak and Flowers 水题
- Codeforces Round #261 (Div. 2) B. Pashmak and Flowers (水题)
- Codeforces Round #261 (Div. 2) 459B. Pashmak and Flowers(数学题,组合)
- Codeforces Round #261 (Div. 2)B. Pashmak and Flowers(容易)
- Codeforces Round #261 (Div. 2) B. Pashmak and Flowers (sorting)
- Codeforces #261 (Div. 2)B. Pashmak and Flowers
- 【CODEFORCES】 B. Pashmak and Flowers
- #261B. Pashmak and Flowers
- Codeforces Round #381 (Div. 2) B. Alyona and flowers
- Codeforces Round #209 (Div. 2) B. Alyona and flowers
- Codeforces Round #261 (Div. 2) A. Pashmak and Garden (水题)
- Codeforces Round #261 (Div. 2) E. Pashmak and Graph
- Codeforces Round #261 (Div. 2) A. Pashmak and Garden
- [开源名人访谈录] Philippe Gerum
- 基于opencv+vs视频运动区域提取
- iOS 实现QQ界面
- 香烟还是时不时的点着
- 8大排序算法图文讲解
- Codeforces Round #261 (Div. 2) B. Pashmak and Flowers
- 一段碰撞检测代码
- 021
- Servlet3.0-使用注解定义Servlet
- 页面间传值的问题
- java调用sap函数
- java 类的static块
- 2012VS格式化快捷方式
- 让你的Git水平更上一层楼的10个小贴士