点击这里查看原题
水题
/*
User:Small
Language:C++
Problem No.:1660
*/
#include<bits/stdc++.h>
#define ll long long
#define inf 999999999
using namespace std;
const int M=8e4+5;
int n,c[M],s[M],tp;
ll ans;
int main(){
freopen("data.in","r",stdin);//
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&c[i]);
for(int i=1;i<=n;i++){
while(tp&&s[tp]<=c[i]) tp--;
ans+=tp;
s[++tp]=c[i];
}
printf("%lld\n",ans);
return 0;
}