Bad Hair Day
Time Limit: 2000MS Memory Limit: 65536K
Description
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
Cow#4 can see no cow’s hairstyle
Cow#5 can see the hairstyle of cow 6
Cow#6 can see no cows at all!
Let ci denote the number of cows whose hairstyle is visible from cow i; please compute the sum of c1 through cN.For this example, the desired is answer 3 + 0 + 1 + 0 + 1 + 0 = 5.
Input
Line 1: The number of cows, N.
Lines 2…N+1: Line i+1 contains a single integer that is the height of cow i.
Output
Line 1: A single integer that is the sum of c1 through cN.
Sample Input
6
10
3
7
4
12
2
Sample Output
5
思路:
由图可以看出来只有右边的小于左边的才能往右看,如果暴力的话时间复杂度肯定很大,所以就用栈的办法,栈顶就是从栈底可以一直向右看齐到栈顶,这样的话假如一个栈顶的话,那么栈底到前栈顶都可以向右看齐,假如有所阻碍就让栈顶出栈。
#include <iostream>
#include <stack>
using namespace std;
typedef long long ll;
int main() {
stack<ll> sta;
ll n, x, ans = 0;
scanf("%lld", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", &x);
while (!sta.empty() && sta.top() <= x) {
sta.pop();
}
ans += sta.size();
sta.push(x);
}
printf("%lld", ans);
return 0;
}