PAT 1117 Eddington Number_pat1117-优快云博客

本文介绍了一种基于骑行里程计算Eddington数的方法，并提供了一个简单的C++实现。Eddington数是一个衡量骑行者耐力的指标，表示一个人骑行超过相应天数的最长里程数。输入为连续骑行天数及其每天的里程，输出则为该系列骑行数据对应的Eddington数。

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

1117. Eddington Number(25)

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⁵), the days of continuous riding. Then N non-negative integers are given in the next line, being the riding distances of everyday.

Output Specification:

For each case, print in a line the Eddington number for these N days.

Sample Input:

10
6 7 6 9 3 10 8 2 7 8

Sample Output:

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
bool cmp(int a,int b){
	return a>b;
}
int main(){
	int i,n;
	int miles[100005];
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>miles[i];
	}
	sort(miles+1,miles+n+1,cmp);
	for(i=1;i<=n;i++){
		if(miles[i]<=i){
			break;
		}
	}
	cout<<i-1<<endl;
	return 0;
}