how many hairstyles can they see?
-
描述
-
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). 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.
For example:
There are six cows, heights are 10 2 7 3 12 2.
Now 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!-
输入
-
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.
输出
- Line 1: A single integer that is the sum of c1 through cN. 样例输入
-
6 10 2 7 3 12 2
样例输出
-
5
-
//nyoj 853 how many hairstyles can they see? //使用单调栈来维护, 看栈里比他高的数目即为可看到他的人数 #include <stdio.h> int stack[80001], top; int main() { int n, i, temp, sum; while(scanf("%d", &n) != EOF) { sum = top = 0; for(i = 0; i < n; i++) { scanf("%d", &temp); while(top != 0 && temp >= stack[top]) { top--; } sum += top; stack[++top] = temp; } printf("%d\n", sum); } return 0; }
-
Line 1: The number of cows, N.