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<iostream>
#include<stack>
typedef long long ll;
using namespace std;

int main()
{
	ll n,x;
	stack<ll>sk;
	cin>>n;
	ll ans=0;
	for(ll i=1; i<=n; i++)
	{
		cin>>x;
		if(sk.size()==0) sk.push(x);
		else
		{
			if(sk.top()>x)
			{
				ans=ans+sk.size();
				sk.push(x);
			}
			else
			{
				while(!sk.empty()&&sk.top()<=x)
					sk.pop();
				ans=ans+sk.size();
				sk.push(x);
			}
		}
	}
	cout<<ans<<endl;
	return 0;
}