H - 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.
(ai……an)牛看到后面其他牛的个数和=前面的牛能看到（a1……an）牛的个数和

#include<iostream>
#include<stack>
#include<cstdio>
using namespace std;
const int num=800000;
int T_T[num],n;
void find_out(){
    long long sum=0;
    stack<int>bag;
    bag.push(1);//初始化第一个牛肯定不能被看到
    for(int i=2;i<=n;i++){
            while(!bag.empty()&&T_T[bag.top()]<=T_T[i]){
            bag.pop();}//判断比它高的牛有几个（也是能看到它的牛有几个）如果比它矮则不能看到弹出栈外不再发挥作用
            sum+=bag.size();
            bag.push(i);
        }

    cout<<sum<<endl;
}
int main()
{
    while(~scanf("%d",&n)){
        for(int i=1;i<=n;i++)
            scanf("%d",&T_T[i]);
            find_out();
    }
}