【BZOJ1208】平衡树

和1588是一样的题吧…

分析
splay裸题。
我懒
直接上了两个set

就做完了

#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
using namespace std;
const int maxn = 1e5+7;
const int mod = 1000000;
int n;
set<int> dog,per;
int main()
{
	scanf("%d",&n);
	int cnt = 0;
	dog.insert(INF);
	dog.insert(-INF);
	per.insert(INF);
	per.insert(-INF);
	int ans = 0;
	for(int i=0;i<n;i++)
	{
		int a,b;
		scanf("%d%d",&a,&b);
		if(a==0)
		{
			if(per.size()>2)
			{
				set<int>::iterator succ = per.lower_bound(b);
				set<int>::iterator pre = succ;
				pre--;
				if(abs(*pre-b)<=abs(*succ-b))
				{
					per.erase(pre);
					ans = (ans+abs(*pre-b))%mod;
				}
				else
				{
					per.erase(succ);
					ans = (ans+abs(*succ-b))%mod;
				}
			}
			else
			{
				dog.insert(b);
			}
		}
		else
		{
			if(dog.size()>2)
			{
				set<int>::iterator succ = dog.lower_bound(b);
				set<int>::iterator pre = succ;
				pre--;
				if(abs(*pre-b)<=abs(*succ-b))
				{
					dog.erase(pre);
					ans = (ans+abs(*pre-b))%mod;
				}
				else
				{
					dog.erase(succ);
					ans = (ans+abs(*succ-b))%mod;
				}
			}
			else
			{
				per.insert(b);
			}
		}
	}
	printf("%d\n",ans);
	return 0;
}