hnoi2002 营业额统计

题目大意：给定n个数，求每个数与前面的数的差值的绝对值最小总和。

题目分析：splay入门题，用splay维护前i个数找到差值最接近的相减取绝对值即可。

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<cctype>
#include<cassert>
#include<climits>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define RepD(i,n) for(int i=n;i>=0;i--)
#define MEM(a) memset(a,0,sizeof(a))
#define MEMI(a) memset(a,127,sizeof(a))
#define MEMi(a) memset(a,128,sizeof(a))
#define INF (2139062143)
#define phiF (1000000006)
#define MAXN (1000000+10)
typedef long long LL;

struct info{
	int val,lc,rc,fa;
}tree[50005];
int root,inf=1e9,n,ans;

inline void zig(int x,int y){
	if (!tree[y].fa) root=x;
	else {if (tree[tree[y].fa].lc==y) 
		tree[tree[y].fa].lc=x;
	else tree[tree[y].fa].rc=x;}
	tree[x].fa=tree[y].fa;
	tree[y].fa=x;
	tree[y].lc=tree[x].rc;
	tree[tree[x].rc].fa=y;
	tree[x].rc=y;
}

inline void zag(int x,int y){
	if (!tree[y].fa) root=x;
	else {if (tree[tree[y].fa].lc==y)
		tree[tree[y].fa].lc=x;
	else tree[tree[y].fa].rc=x;}
	tree[x].fa=tree[y].fa;
	tree[y].fa=x;
	tree[y].rc=tree[x].lc;
	tree[tree[x].lc].fa=y;
	tree[x].lc=y;
}


inline void splay(int x){
	for (int y,z;tree[x].fa;){
	y=tree[x].fa;z=tree[y].fa;
		if (!z){
			if (tree[y].lc==x) zig(x,y);else zag(x,y);
		}else {
			if (tree[z].lc==y) {
				if (tree[y].lc==x) {
					zig(y,z);zig(x,y);
				}else {
					zag(x,y);zig(x,z);
				}
			}else {
				if (tree[y].lc==x){
					zig(x,y);zag(x,z);
				}else {
					zag(y,z);zag(x,y);
				}
			}
		}
	}
}


inline void ins(int x){
	int i=root;
	for (;true;){
		if (tree[x].val<tree[i].val) {
			if (!tree[i].lc) {
				tree[i].lc=x;tree[x].fa=i;break;
			}else i=tree[i].lc;
		}else {
			if (!tree[i].rc){
			   tree[i].rc=x;tree[x].fa=i;break;	
			}else i=tree[i].rc;
		}
	}
	splay(x);
}

inline int getprev(int x){
	splay(x);
	if (!tree[x].lc) return -inf;
	for (x=tree[x].lc;tree[x].rc;x=tree[x].rc);
	return tree[x].val;
}


inline int getnext(int x){
	splay(x);
	if (!tree[x].rc)return inf;
	for (x=tree[x].rc;tree[x].lc;x=tree[x].lc);
	return tree[x].val;
}

int main(){
	scanf("%d",&n);
	scanf("%d",&tree[1].val);root=1;
	ans=tree[1].val;
	Fork (i,2,n){
		scanf("%d",&tree[i].val);
		ins(i);
		ans+=min(tree[i].val-getprev(i),getnext(i)-tree[i].val);
	}
	printf("%d",ans);
}