【PAT】A1117 Eddington Number 【排序】

最新推荐文章于 2021-09-08 20:01:45 发布

昵称五个字

最新推荐文章于 2021-09-08 20:01:45 发布

阅读量531

点赞数 1

CC 4.0 BY-SA版权

分类专栏： PAT

本文链接：https://blog.youkuaiyun.com/a617976080/article/details/99410183

该博客介绍了Eddington Number的概念，即寻找连续骑行天数中，每天骑行距离大于天数的最大整数E。通过给出的骑行天数N和每天的骑行距离，博客提供了一种算法思路：将距离数组降序排列，然后检查每个元素是否大于当前E值加1，来找到满足条件的最大E值。给出了样例输入和输出，以及解题思路和代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

British astronomer Eddington liked to ride a bike. It is said that in order to show off his skill, he has even defined an “Eddington number”, E – that is, the maximum integer E such that it is for E days that one rides more than E miles. Eddington’s own E was 87.

Now given everyday’s distances that one rides for N days, you are supposed to find the corresponding E (≤N).

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (≤10^5), the days of continuous riding. Then N non-negative integers are given in the next line, being the riding distances of everyday.