将一系列给定数字插入一个初始为空的小顶堆H[]
。随后对任意给定的下标i
,打印从H[i]
到根结点的路径。
输入格式:
每组测试第1行包含2个正整数N和M(≤1000),分别是插入元素的个数、以及需要打印的路径条数。下一行给出区间[-10000, 10000]内的N个要被插入一个初始为空的小顶堆的整数。最后一行给出M个下标。
输出格式:
对输入中给出的每个下标i
,在一行中输出从H[i]
到根结点的路径上的数据。数字间以1个空格分隔,行末不得有多余空格。
输入样例:
5 3
46 23 26 24 10
5 4 3
输出样例:
24 23 10
46 23 10
26 10
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#define MAXSIZE 1000
#define MINDATA -10001
typedef struct HNode* Heap;
struct HNode {
int* Data;
int Size;
};
typedef Heap MinHeap;
MinHeap CreateHeap(int MaxSize) {
MinHeap H = (MinHeap)malloc(sizeof(struct HNode));
H->Data = (int*)malloc((MaxSize + 1) * sizeof(int));
H->Size = 0;
H->Data[0] = MINDATA;
return H;
}
void InsertHeap(MinHeap H, int X) {
if (H->Size == MAXSIZE)return;
H->Data[++H->Size] = X;
int i = H->Size;
for (; H->Data[i / 2] > X; i /= 2)
H->Data[i] = H->Data[i / 2];
H->Data[i] = X;
}
int main() {
int N, M,i,X;
scanf("%d %d", &N, &M);
MinHeap H = CreateHeap(N);
for (i = 0; i < N; i++) {
scanf("%d", &X);
InsertHeap(H, X);
}
for (i = 0; i < M; i++) {
int index;
scanf("%d", &index);
for (; index >= 1; index /= 2) {
if (index == 1)printf("%d\n", H->Data[index]);
else printf("%d ", H->Data[index]);
}
}
system("pause");
return 0;
}