FHQ Treap

复习 FHQ

#include <bits/stdc++.h>
#define II int
#define R register
#define IL inline
#define I 123546
using namespace std;

IL void of(R II &a) {
	R char c=getchar(); R II w=1, p=0;
	while (c<'0' || c>'9') { if(c=='-') w=-1; c=getchar(); }
	while (c>='0' && c<='9') { p=p*10+c-'0'; c=getchar(); }
	a=w*p;
}

/* -------------------- Peipei -------------------- */

II n,root,ans,End;
struct owo { II l,r,w,ra; } Tr[I];

IL II merge(R II l,R II r) {
	if(l*r==0) return l+r;
	if(Tr[l].ra<Tr[r].ra) {
		Tr[l].r=merge(Tr[l].r,r);
		return l;
	} else {
		Tr[r].l=merge(l,Tr[r].l);
		return r;
	}
}

IL void split(R II x,R II &l,R II &r,R II w) {
	if(!x) { l=r=0; return ; }
	if(Tr[x].w<=w) l=x, split(Tr[x].r,Tr[l].r,r,w);
	else r=x, split(Tr[x].l,l,Tr[r].l,w);
}

IL II Abs(R II x) { return x<0 ? -x : x ; }
IL void to_find(R II x,R II w) {
	if(!x) return ;
	ans=min(ans,Abs(Tr[x].w-w));
	if(Tr[x].w==w) return ; 
	if(Tr[x].w<w) to_find(Tr[x].r,w);
	else to_find(Tr[x].l,w);
}

int main()
{
//	freopen("1.in","r",stdin);
	
	srand(time(0));
	of(n); 
	for(R II i=1,x,l,r;i<=n;i++) 
	{
		of(x); ans=1e9;
		Tr[i]=(owo) {0,0,x,rand()};
		if(i==1) {
			End+=x; root=1;
			continue ;
		}
		to_find(root,x);
		End+=ans;
		split(root,l,r,x-1);
		root=merge(merge(l,i),r);
	}
	
	printf("%d\n",End);
	exit(0);
}