当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

6276:Easy $h$-index

题目描述
比赛题目:
http://acm.hdu.edu.cn/downloads/2018ccpc_hn.pdf

The $h$-index of an author is the largest $h$ where he has at least $h$ papers with citations not less than $h$.

Bobo has published many papers.
Given $a_0, a_1, a_2, \dots, a_{n}$ which means Bobo has published $a_i$ papers with citations exactly $i$, find the $h$-index of Bobo.

输入解释
The input consists of several test cases and is terminated by end-of-file.

The first line of each test case contains an integer $n$.
The second line contains $(n+1)$ integers $a_0, a_1, \dots, a_n$.
输出解释
For each test case, print an integer which denotes the result.

## Constraint

* $1 \leq n \leq 2 \cdot 10^5$
* $0 \leq a_i \leq 10^9$
* The sum of $n$ does not exceed $250,000$.
输入样例
1
1 2
2
1 2 3
3
0 0 0 0
输出样例
1
2
0
来自杭电HDUOJ的附加信息
Recommend liuyiding

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-6276

最后修改于 2020-10-25T23:29:54+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 32768/32768K(Java/Others)