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 c 1 through cN.

Sample Input

6
10
3
7
4
12
2

Sample Output

5

题意：给出每个牛的高度，问每个牛能看到多少牛，求总和。

解析:将每个牛能看到多少牛 -> 每头牛能被多少牛看到。问题就简化成，当加入这头牛的高度，如果栈内的牛比他的高度小，那么肯定是看不到的，那么他后面的牛，也不会被这个矮牛看到，那么这些矮牛就可以弹出来了，然后将这头牛加进去~

#include<iostream>
#include<algorithm>
#include<queue>
#include<cstdio>
#include<vector>
#include<stack>
#include<cstring>
#include<string>
using namespace std;
#define maxn 100005
#define eps 1e-6
#define PI 3.14159265359
int n;
int main()
{
    while(~scanf("%d",&n)&&n)
    {
        stack<int>s;
        long long int ans = 0;
        int x;
        scanf("%d",&x);
        s.push(x);
        for(int i = 1; i < n; i ++)
        {
            scanf("%d",&x);
            while(!s.empty()&&x>=s.top())
                s.pop();
            ans += s.size();
            s.push(x);
        }
        printf("%lld\n",ans);
    }
}