单调栈 - 洛谷 P2866

#include <bits/stdc++.h>
using namespace std;

int n;
long long st[100010], top, ans, h;

int main(){
	//freopen("input.txt", "r", stdin);
	scanf("%d", &n);
	st[0] = 1e9 + 10, top = ans = 0;
	for(int i = 1; i <= n; i++){
		scanf("%lld", &h);
		while(st[top] <= h) top--;
		ans += top;
		st[++top] = h;
	}
	cout << ans << endl;
	return 0;
}