1117 Eddington Number （25 分）

最新推荐文章于 2024-05-07 12:18:40 发布

依久_

最新推荐文章于 2024-05-07 12:18:40 发布

阅读量221

点赞数

分类专栏： PAT甲

本文链接：https://blog.youkuaiyun.com/acm_zh/article/details/87911195

版权

PAT甲专栏收录该内容

53 篇文章

订阅专栏

本文介绍了一种基于连续骑行天数和每日骑行距离计算Eddington数的方法，Eddington数定义为最大整数E，使得有E天的骑行距离超过E英里。通过输入连续N天的骑行距离，文章提供了计算对应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 (≤105), 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<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int cmp(int a,int b){
	return a > b;
}
int main(){
	int n;
	cin >> n;
	int cnt = 0;
	vector<int> v(100005);
	for(int i = 0;i < n;i++){
		cin >> v[i];
	} 
	sort(v.begin(),v.end(),cmp);
	while(cnt < n&&v[cnt] > cnt+1){
		cnt++;
	}
	cout << cnt << endl;
}