博客介绍了USACO比赛中的‘向右看齐’问题，涉及N头奶牛按身高排列，每头奶牛看向右侧更高奶牛的索引。通过分析，提出使用自底向上的方法解决此模拟问题，避免双层循环导致的时间复杂度过高，最终实现时间为O(n log n)。
题目描述
Farmer John’s N (1 <= N <= 100,000) cows, conveniently numbered 1..N, are once again standing in a row. Cow i has height H_i (1 <= H_i <= 1,000,000).
Each cow is looking to her left toward those with higher index numbers. We say that cow i ‘looks up’ to cow j if i < j and H_i < H_j. For each cow i, FJ would like to know the index of the first cow in line looked up to by cow i.
Note: about 50% of the test data will have N <= 1,000.
约翰的N(1≤N≤10^5)头奶牛站成一排，奶牛i的身高是Hi(l≤Hi≤1,000,000)．现在，每只奶牛都在向右看齐．对于奶牛i，如果奶牛j满足i
Input
输入输出格式
输入格式：
* Line 1: A single integer: N
- Lines 2..N+1: Line i+1 contains the single integer: H_i
第 1 行输入 N，之后每行输入一个身高 H_i。
输出格式：
* Lines
最低0.47元/天 解锁文章
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
