1117 Eddington Number-PAT甲级

最新推荐文章于 2020-07-18 18:16:47 发布

星辰浩宇

最新推荐文章于 2020-07-18 18:16:47 发布

阅读量132

点赞数

分类专栏： pat甲级

本文链接：https://blog.csdn.net/amf12345/article/details/99301809

版权

pat甲级专栏收录该内容

153 篇文章 0 订阅

订阅专栏

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:

根据题意可知求解最大的k，满足有k天的骑行距离大于等于k，用二分查找法即可求得k

注意在求解的时候答案不一定为输入的数字，比下一个数小1即可

满分代码如下：

#include<bits/stdc++.h>
using namespace std;
const int N=100010;
int dst[N];
int n;
int main(){
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>dst[i];
	}
	sort(dst,dst+n);
	int max_num=-1,v=0,h=-1;
	for(int i=0;i<n;i++){
		int k=upper_bound(dst,dst+n,dst[i])-dst;
		k=n-k;
		if(k>=dst[i]&&dst[i]>=max_num){
			max_num=dst[i];
			h=i;
		}
	}
	cout<<dst[h+1]-1<<endl;
	return 0;
}