bzoj1208: [HNOI2004]宠物收养所

题面在这里

splay练习，按题意模拟着做，每次找前驱后继即可。代码比较丑= = 而且里面有一些不必要的东西比如sz[]这个数组是不需要的。

ps. wzp是一超级无敌巨佬名字，大家可以尽情地%他....

/*************************************************************
	Problem: bzoj 1208 [HNOI2004]宠物收养所
	User: fengyuan
	Language: C++
	Result: Accepted
	Time: 216 ms
	Memory: 2784 kb
	Submit_Time: 2017-11-24 20:20:24
*************************************************************/

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

const int N = 100010;
const int INF = 1e9;
const int WZP = 1000000;
int opt, ans, tot, rt, pos;
int fa[N], data[N], sz[N], ch[N][2];

inline void pushup(int x)
{
	sz[x] = sz[ch[x][0]] + sz[ch[x][1]] + 1;
}

inline void rot(int x)
{
	int y = fa[x], z = fa[y];
	bool f = ch[y][1] == x;
	ch[y][f] = ch[x][f^1];
	if (ch[x][f^1]) fa[ch[x][f^1]] = y;
	fa[x] = z;
	if (z) ch[z][ch[z][1] == y] = x;
	fa[y] = x; ch[x][f^1] = y;
	pushup(y); pushup(x);
}

inline void splay(int x, int top)
{
	while (fa[x] != top){
		int y = fa[x], z = fa[y];
		if (z != top) rot((ch[z][0] == y) == (ch[y][0] == x) ? y : x);
		rot(x);
	}
	if (!top) rt = x;
}

inline void ins(int v)
{
	int x = rt;
	if (!rt){
		rt = x = ++ tot;
		data[x] = v; sz[x] = 1;
		fa[x] = ch[x][0] = ch[x][1] = 0;
		return;
	}
	while (x){
		sz[x] ++;
		int &y = ch[x][v > data[x]];
		if (!y){
			y = ++ tot;
			data[y] = v; sz[y] = 1;
			fa[y] = x; ch[y][0] = ch[y][1] = 0;
			x = y;
			break;
		}
		x = y;
	}
	splay(x, 0);
}

inline int find(int v)
{
	int x = rt;
	while (data[x] != v && x) x = ch[x][v > data[x]];
	return x;
}

inline int getPre(int x)
{
	x = ch[x][0];
	while (ch[x][1]) x = ch[x][1];
	return x;
}

inline int getNxt(int x)
{
	x = ch[x][1];
	while (ch[x][0]) x = ch[x][0];
	return x;
}

inline void del(int x)
{
	splay(x, 0);
	if (ch[x][0] == 0){
		rt = ch[x][1];
		fa[rt] = 0;
	} else {
		int y = getPre(x);
		splay(y, x);
		rt = y;
		fa[y] = 0;
		ch[y][1] = ch[x][1];
		fa[ch[x][1]] = y;
	}
}

//debug
inline void printTree(int rt)
{
	if (ch[rt][0]) printTree(ch[rt][0]);
	printf("%d ", data[rt]);
	if (ch[rt][1]) printTree(ch[rt][1]);
}

int main()
{
	scanf("%d", &opt);
	ins(-INF); ins(INF);
	int cnt = 0, flag = -1;
	while (opt --){
		int type, x; scanf("%d%d", &type, &x);
		if (flag == -1){
			flag = type; cnt ++;
			ins(x);
			continue;
		}
		if (type == flag){
			cnt ++; ins(x);
		} else {
			cnt --;
			if (cnt == 0) flag = -1;
			if ((pos = find(x)) == 0){
				ins(x);
				pos = rt;
				int prp = getPre(pos), pr = data[prp], nxp = getNxt(pos), nx = data[nxp], val, vp;
				if (x - pr <= nx - x){
					val = pr; vp = prp;
				} else {
					val = nx; vp = nxp;
				}
				ans += abs(val-x);
				ans = ans%WZP;
				del(pos);
				del(vp);
			} else del(pos);
		}
	}
	printf("%d\n", ans);
	return 0;
}