L2-012 关于堆的判断 (25 分)

最新推荐文章于 2025-04-16 19:36:23 发布

moumoumouwang

最新推荐文章于 2025-04-16 19:36:23 发布

阅读量90

点赞数

文章标签：模拟堆

本文链接：https://blog.youkuaiyun.com/moumoumouwang/article/details/114459171

版权

天梯赛专栏收录该内容

35 篇文章

订阅专栏

本文介绍了一个C++程序，使用upAdjust函数调整数组以实现二叉搜索树特性，并通过judgeroot、judgebro、judgepar和judgechi函数判断根节点、兄弟关系、父子关系和孩子关系。程序处理输入的查询，如and操作和特定树结构验证。

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

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn = 1010;

vector<int> v;
int n, m;
void upAdjust(int i)
{
	if(i == 1) return;
	while(i != 1)
	{
		if(v[i] < v[i / 2])
		{
			swap(v[i], v[i / 2]);
			i = i / 2;
		}
		else break;
	}
}
bool judgeroot(int x)
{
	if(x == v[1]) return true;
	else return false;
}
bool judgebro(int a, int b)
{
	int fa,fb;
	for(int i = 1; i <= n; i++) 
	{
		if(v[i] == a) fa = i;
	}
	for(int i = 1; i <= n; i++) 
	{
		if(v[i] == b) fb = i;
	}
	if(fa/2 == fb/2) return true;
	else return false;
}
bool judgepar(int a, int b)
{
	int fa,fb;
	for(int i = 1; i <= n; i++) 
	{
		if(v[i] == a) fa = i;
	}
	for(int i = 1; i <= n; i++) 
	{
		if(v[i] == b) fb = i;
	}
	if(fa == fb / 2) return true;
	else return false;
}
bool judgechi(int a, int b)
{
	int fa,fb;
	for(int i = 1; i <= n; i++) 
	{
		if(v[i] == a) fa = i;
	}
	for(int i = 1; i <= n; i++) 
	{
		if(v[i] == b) fb = i;
	}
	// printf("fa = %d, fb = %d\n", fa,fb);
	if( fa / 2 == fb) return true;
	else return false;
}
int main()
{
	int a,b;
	cin >> n >> m;
	string str;
	v.resize(n + 1);
	for(int i = 1; i <= n; i++)
	{
		cin >> v[i];
		upAdjust(i);
	}
	while(m--)
	{
		cin >> a >> str;
		if(str == "and") // and
		{	
			cin >> b >> str >> str;
			if(judgebro(a,b)) cout << "T" << endl;
			else cout << "F" << endl;
		}
		else
		{
			cin >> str;
			if(str == "a")
			{
				cin >> str >> str >> b;
				if(judgechi(a,b)) cout << "T" << endl;
				else cout << "F" << endl;
			}
			else
			{
				cin >> str;
				if(str == "root")
				{
					if(judgeroot(a)) cout << "T" << endl;
					else cout << "F" << endl;
				}
				else
				{
					cin >> str >> b;
					if(judgepar(a,b)) cout << "T" << endl;
					else cout << "F" << endl;
				}
			}
		}

	}
	return 0;
}