qq_41805174的博客

原创 PAT甲级 1147 Heaps

PAT甲级 1147 Heaps PAT1147链接 题目大意 给定查询次数M和完全二叉树的结点个数N及每棵树的层序遍历，每次查询输出它的后序遍历，并判断是否为最大最小堆 # include<iostream> # include<cstring> # include<vector> using namespace std; const int maxn = 1010; vector<int>post; int layer[maxn]; //int Compl