蒟蒻只会用分块qwq，然后就爆0了，全wa

#include <iostream>
#include <cmath>
#define N 500005
#define BLOCK_SIZE 1005
using namespace std;
int n,a[N];
int s[BLOCK_SIZE],L[BLOCK_SIZE],R[BLOCK_SIZE],id[N],len,block_ct,ct;
inline int query(int ql){
	int l=id[ql],t=a[ql];
	for(int i=ql;id[i]==l;i++){
		if(a[i]>t)return i;
	} 
	for(int i=l+1;i<=block_ct;i++){
		if(s[i]>t){
			for(int j=L[i];j<=R[i];j++){
				if(a[j]>t)return j;
			} 
		}
	}
	return n;
}
int main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin>>n;
	len=(int)(sqrt(n))+1;
	block_ct=ceil(n/(len*1.00));
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=1;i<=n;i++){
		id[i]=(i-1)/len+1;
		s[id[i]]=max(s[id[i]],a[i]);
	}
	for(int i=1;i<=block_ct;i++){
		L[i]=(i-1)*len+1;
		R[i]=min(n,i*len);
		cout<<s[i]<<' '<<L[i]<<' '<<R[i]<<' ';
	}
	cout<<endl;
	for(int i=1;i<n;i++){
		int m=query(i);
		ct+=m-i;
	}
	cout<<ct<<'\n';
	return 0;
}