该博客介绍了HZNUOJ 1472题目的解决方案，即计算每头牛与其最近的比它高的牛之间的平均距离。当直接暴力解法会导致超时，作者提出了一种优化算法，通过双向扫描并记录答案的方法提高效率。博客提供了样例输入和输出，并给出了防止精度问题的提示以及AC代码。
1472: The nearest taller cow
Time Limit: 3 Sec Memory Limit: 64 MB
Submit: 151 Solved: 6 Scores: 94.48
Description
Farmer Zhao’s N cows (1 ≤ N ≤ 1,000,000) are lined up in a row. So each cow can see the nearest cow which is taller than it. You task is simple, given the height (0 < height ≤ 109) of each cow lined up in the row, to calculate the distance between each cow and its nearest taller cow (the nearest cow which is taller than him), if it is the tallest cow in the row, such distance is regarded as n. You should output the average distance.
Input
For each test case:
Line 1: One integers, N
Lines 2: N integers. The i-th integer is the height of the ith cow in the row.
Output
The average distance to their nearest taller cow, rounded up to 2 decimals.
Sample Input
7
最低0.47元/天 解锁文章
扫一扫
777
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
