单调栈之Bad Hair Day

单调栈有以下两个性质：

1、若是单调递增栈，则从栈顶到栈底的元素是严格递增的。若是单调递减栈，则从栈顶到栈底的元素是严格递减的。

2、越靠近栈顶的元素越后进栈。

单调栈与单调队列不同的地方在于栈只能在栈顶操作，因此一般在应用单调栈的地方不限定栈的大小，否则可能会造成元素无法进栈。

元素进栈过程：对于单调递增栈，若当前进栈元素为e，从栈顶开始遍历元素，把小于e或者等于e的元素弹出栈，直接遇到一个大于e的元素或者栈为空为止，然后再把e压入栈中。对于单调递减栈，则每次弹出的是大于e或者等于e的元素。
例题：
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<cstdio>
#include<iostream>
#include<stack>
using namespace std;
typedef long long ll;
stack<int>a;
int main()
{
 int n,t;
 ll cnt=0;
 cin>>n;
 cin>>t;
 a.push(t);
 for(int i=1;i<n;i++)
 {
  cin>>t;
  while(!a.empty()&&a.top()<=t)
      a.pop();
  cnt+=a.size();
  a.push(t);
 }
 cout<<cnt<<endl;
 return 0;
 }