Bad Hair Day

/*  统被看到牛的头的个数，只要有较高的牛挡住了，就看不到后面牛的个数 ，注意是从左往右看  */

#include < iostream >#include < cstdio   >#include < cstring  >#define     N 1000005using namespace  std;typedef __int64   LL;LL a[N],x,s;int main (){//freopen("dddl.txt","r",stdin);int n,i,t;while(scanf("%d",&n)!=EOF){t=1;s=0;memset(a,-1,sizeof(a));for(i=1 ; i<=n ; i++){scanf("%I64d",&x);while(t>0 && a[t]<=x) t--;s+=t;a[++t]=x;}printf("%I64d\n",s);}return 0;}