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 h_i (1 ≤ h_i ≤ 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

/*

 题意：问所有的牛能看到的牛的总和。

 解题报告： 当输入的数小于栈中的元素就压到栈中，把栈中的元素小于当前输入元素就把其弹出。

*/

标程：

#include<stdio.h>
#include<stack>
using namespace std;


int main()
{
    //freopen("a.txt","r",stdin);
    int n,i,m;
    stack<long long> st;
    while(scanf("%d",&n)!=EOF)
    {
        int sum=0;
        scanf("%d",&m);
        st.push(m);
        for(i=1;i<n;++i)
        {
            scanf("%d",&m);
            for(;!st.empty() && m>=st.top();) st.pop();
            st.push(m);
            sum+=st.size();
        }
        printf("%d\n",sum-n+1);
        for(;!st.empty();) st.pop();
    }
    return 0;
}