农夫约翰的N头奶牛中有些正在经历糟糕的发型日。每头奶牛的高度为hi，面对东方站立。FJ想要计算一头奶牛能看到其他奶牛头顶的数量。如果一头奶牛前面的奶牛比它矮，那么它就能看到那头奶牛的头顶。题目要求计算每头奶牛能看到的其他奶牛头顶数量之和。例如，给定6头奶牛的高度，计算结果为5。输入包含奶牛的数量和每头奶牛的高度，输出为所有奶牛能看到的奶牛头顶数之和。
Some of Farmer John's N cows (1 ≤ N ≤ 80,000) are having a bad hair day! Since each cow is self-conscious about her messy hairstyle, FJ wants to count the number of other cows that can see the top of other cows' heads.
Each cow i has a specified height hi (1 ≤ hi ≤ 1,000,000,000) and is standing in a line of cows all facing east (to the right in our diagrams). Therefore, cow i can see the tops of the heads of cows in front of her (namely cows i+1, i+2, and so on), for as long as these cows are strictly shorter than cow i.
Consider this example:
= = = = - = Cows facing right --> = = = = - = = = = = = = = = 1 2 3 4 5 6
Cow#1 can see the hairstyle of cows #2, 3, 4
Cow#2 can see no cow's hairstyle
Cow#3 can see the hairstyle of cow #4
最低0.47元/天 解锁文章
扫一扫
480
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
