bzoj1588.营业额统计(splay)

给一个序列，对于每个数，找出在他前面的与他相差最小的数，把他们的差求和

splay 模版，还可以用 set 搞一搞，因为是在练 splay，就不写 set 的了。

#include <cstdio>
#include <algorithm>

using namespace std;

const int MAX_N = 50005;

int tr[MAX_N][2], val[MAX_N], f[MAX_N];
int n, R, siz = 0, ans = 0, t1, t2;

void tree_rot(int x, int &k)
{
	int y = f[x], z = f[y], l, r;
	if (tr[y][0] == x) l = 0; else l = 1;
	r = l ^ 1;
	if (y == k) k = x;
	else { if (tr[z][0] == y) tr[z][0] = x; else tr[z][1] = x; }
	f[x] = z; f[y] = x; f[tr[x][r]] = y;
	tr[y][l] = tr[x][r]; tr[x][r] = y;
}

void tree_splay(int &k, int x)
{
	int y, z;
	while (x != k){
		y = f[x]; z = f[y];
		if (y != k){
			if ((tr[y][0] == x) ^ (tr[z][0] == y)) tree_rot(x, k);
			else tree_rot(y, k);
		}
		tree_rot(x, k);
	}
}

void tree_ins(int &k, int x, int last)
{
	if (!k){
		siz ++; k = siz; val[k] = x; f[k] = last;
		tree_splay(R, k); return;
	}
	if (x < val[k]) tree_ins(tr[k][0], x, k);
		else tree_ins(tr[k][1], x, k);
}

void get_pre(int &k, int x)
{
	if (!k) return;
	if (x >= val[k]) { t1 = val[k]; get_pre(tr[k][1], x); }
		else get_pre(tr[k][0], x);
}

void get_next(int &k, int x)
{
	if (!k) return;
	if (x <= val[k]) { t2 = val[k]; get_next(tr[k][0], x); }
		else get_next(tr[k][1], x);
}

void init()
{
	scanf("%d", &n);
	for (int i = 1; i <= n; i ++){
		int x; if(scanf("%d", &x) == EOF) x = 0;
		t1 = -1000000000, t2 = 1000000000;
		get_pre(R, x); get_next(R, x);
		if (i != 1) ans += min(x - t1, t2 - x);
			else ans += x;
		tree_ins(R, x, 0);
	}
}

void doit()
{
	printf("%d\n", ans);
}

int main()
{
	init();
	doit();
	return 0;
}