【总结】9.24-9.25

最新推荐文章于 2024-07-07 21:31:14 发布

emoizhang

最新推荐文章于 2024-07-07 21:31:14 发布

阅读量1.1k

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/emoizhang/article/details/8018848

本文分享了作者在实现Splay树过程中遇到的问题及解决办法，包括指针版Splay树的编写、内存管理和字符串处理等内容，并附上了具体的代码示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

当时生日许下的愿望，要靠自己实现！

9.24-9.25

这两天主要是在玩splay，从来没写过指针版，还加内存回收，所以弄了好久，做基础题嘛..

每天晚上一道，昨天star，今天unhappy

今天被(\n)坑惨了啊...调试n久。

然后学习了一下string。但还是不熟悉。联赛还是用p吧，万一挂了什么的，还是不好。联赛还是很重要的。

截图留念（速度奇慢球不鄙视）

code of unhappy

#include<iostream>
#include<cstdio> 
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#ifdef WIN32
#define ot "%I64d"
#else
#define ot "%lld"
#endif
#define Max(a, b, t) ({t _ = (a), __ = (b); _ > __ ? _ : __;})
#define Min(a, b, t) ({t _ = (a), __ = (b); _ < __ ? _ : __;})
#define maxn 100005

using namespace std;

struct node
{
	int v, s;
	node *f, *c[2];
}vess[maxn];

typedef node *NODE;

NODE pool[maxn], root, null;

int n, mn, tot = maxn - 3, leave = 0, delta = 0;

bool p;

void init()
{
	freopen("unhappy.in", "r", stdin);
	freopen("unhappy.out", "w", stdout);
	scanf("%d %d\n", &n, &mn);
}

void prepare()
{
	null = new node(); null -> f = null -> c[0] = null -> c[1] = null;
	null -> v = null -> s = 0;
	root = null;
	for (int i = 0; i < maxn; i++) pool[i] = &vess[i];
}

NODE newnode(NODE father, int val)
{
	NODE x = pool[tot--];
	if (x -> s)
	{	
		if (x -> c[0] != null) pool[++tot] = x -> c[0];
		if (x -> c[1] != null) pool[++tot] = x -> c[1];
	}
	x -> f = father; x -> c[0] = x -> c[1] = null;
	x -> s = 1; x -> v = val;
	return x;
}

bool fc(NODE x)
{
	return x -> f -> c[1] == x;
}

NODE update(NODE x)
{
	if (x == null) return null;
	x -> s = x -> c[0] -> s + x -> c[1] -> s + 1;
	return x;
}

void rotate(NODE x, int k)
{
	NODE p = x -> f;
	x -> c[!k] -> f = p;
	p -> c[k] = x -> c[!k];
	x -> c[!k] = p;
	x -> f = p -> f;
	p -> f -> c[fc(p)] = x;
	update(p) -> f = x;
}

void splay(NODE to, NODE x)
{
	while (x -> f != to)
	{
		if (x -> f -> f == to) rotate(x, fc(x));
		else if (fc(x) ^ fc(x -> f)) rotate(x, fc(x)), rotate(x, fc(x));
			else rotate(x -> f, fc(x -> f)), rotate(x, fc(x));
	}
	root = update(x);
}

void insert(int k)
{
	if (root == null)
		root = newnode(null, k);
	else
	{
		NODE t = root;
		while (t -> c[p = k > t -> v] != null)
			 t -> s++, t = t -> c[p];
		t -> s++;
		NODE x = newnode(t, k); t -> c[p] = x;
		splay(null, x);
	}
}

void dlt()
{
	insert(mn - delta);
	leave += root -> c[0] -> s;
	root = root -> c[1];
	root -> f -> c[1] = null;
	if (root -> f != null) pool[++tot] = root -> f;
	root -> f = null;
}

int calc(int k)
{
	if (k > root -> s) return (-1 - delta);
	NODE t = root;
	while (1)
	{
		int r = t -> c[1] -> s + 1;
		if (k == r) break;
		if (k > r) k -= r, t = t -> c[0];
			else t = t -> c[1];
	}
	return t -> v;
}

int main()
{
	char ques;
	init();
	prepare();
	int k;
	for (int i = 1; i <= n; i++)
	{
		scanf("%c %d\n", &ques, &k); /*就是这个 \n 坑了好久好久..*/ 
		if (ques == 'I')
		{
			if (k < mn) continue;
			insert(k - delta);
		}
		else if (ques == 'F')
		   printf("%d\n", calc(k) + delta);
		else if (ques == 'A')
			delta += k;
		else delta -= k, dlt();
		scanf("\n");
	}
	printf("%d", leave);
   return 0;
}

另外问问邓大牛，还有什么写丑的没有。（这个要怎么@人呢..）