POJ 3250 Bad Hair Day（单调栈）

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"queue"
#include"stdio.h"
#include"string.h"
#include"algorithm"
using namespace std;
long long a[1000010];
int main()
{
	long long n;
	while(~scanf("%lld",&n))
	{
		long long l=0,sum=0,h;
		scanf("%lld",&h);
		a[++l]=h;//数组模拟栈
		n--;
		while(n--)
		{
			scanf("%lld",&h);
			while(l&&a[l]<=h)
			l--;
			sum+=l;
			a[++l]=h;
		}
		printf("%lld\n",sum);
	}
	return 0;
}