PAT (Advanced Level) Practise 1117 Eddington Number(25)
来源:互联网 发布:网站sql注入漏洞修复 编辑:程序博客网 时间:2024/06/04 23:19
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:106 7 6 9 3 10 8 2 7 8Sample Output:
6
题意:在N天中有E天骑行的路程超过E,然后求E的最大值
解题思路:对n个数据从大到小排序,i表示了骑车的天数,那么满足a[i] > i的最大值即为所求
#include <iostream> #include <cstdio> #include <cstring> #include <string> #include <algorithm> #include <cmath> #include <map> #include <set> #include <stack> #include <queue> #include <vector> #include <bitset> #include <functional> using namespace std; #define LL long long const int INF = 0x3f3f3f3f;int main(){int n,a[100005];while(~scanf("%d",&n)){for(int i=1;i<=n;i++) scanf("%d",&a[i]);sort(a+1,a+1+n,greater<int>());int k=1;while(a[k]>k) k++;printf("%d\n",k-1);}return 0;}
- PAT (Advanced Level) Practise 1117Eddington Number(25)
- PAT (Advanced Level) Practise 1117 Eddington Number(25)
- 【PAT】【Advanced Level】1117. Eddington Number(25)
- 1024. Palindromic Number (25) @ PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1024 Palindromic Number (25)
- PAT (Advanced Level) Practise 1082 Read Number in Chinese (25)
- PAT (Advanced Level) Practise 1082 Read Number in Chinese (25)
- PAT (Advanced Level) Practise 1024 Palindromic Number (25)
- [PAT] (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise
- 剑指offer(求字符的所有组合)
- ieda 运行出现连接数据库问题
- Codeforces 814 B An express train to reveries
- mysql 数据库三大设计结构,三大范式概念
- 【Python】高级特性之切片(slice)
- PAT (Advanced Level) Practise 1117 Eddington Number(25)
- OpenCV中图像的浅拷贝与深拷贝
- ++和--操作符
- Javaweb表单提交及获取属性值
- Spring boot --Oauth2.0 + 单点登录
- 公共数据库介绍~datahub
- deifne小技巧
- ResNet-34 prototxt
- idea web项目与前端网页结合