Codeforces Round #261 (Div. 2)B. Pashmak and Flowers(容易)

WBOY
发布: 2016-06-07 15:13:57
原创
1233 人浏览过

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 b i . Parmida is a very strange girl so she doesn't want to have the two most beautiful 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:

  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.
相关标签:
来源:php.cn
本站声明
本文内容由网友自发贡献,版权归原作者所有,本站不承担相应法律责任。如您发现有涉嫌抄袭侵权的内容,请联系admin@php.cn
热门教程
更多>
最新下载
更多>
网站特效
网站源码
网站素材
前端模板