#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
//m个堆,每个堆n个结点
//输出最大/最小/不是堆 + 后序遍历
vector<int>v;
int m, n;
void postOrder(int index)
{
if (index > n) return;
postOrder(index * 2 );
postOrder(index * 2 + 1);
printf("%d%s", v[index], index == 1 ? "\n" : " ");
}
int main() {
freopen("input.txt", "r", stdin);
cin >> m>>n;
v.resize(n+1);
for(int i =0 ;i<m;i++)
{
for (int j = 1; j <=n; j++)//1号结点开始
cin >> v[j];
//函数
bool isMax = is_heap(v.begin()+1, v.end(), less<int>());
bool isMin = is_heap(v.begin() + 1, v.end(), greater<int>());
//自己判断
//bool isMax = 1,isMin = 1;
//for (int x = 2; x <=n; x++)
//{
//if (v[x/2] > v[x])isMin = 0;
//if (v[x/2] < v[x])isMax = 0;
//}
if (!isMax && !isMin)printf("Not Heap\n");
else isMin == true ? printf("Min Heap\n") : printf("Max Heap\n");
postOrder(1);
}
return 0;
}
【PAT】1147 Heaps (30分) [heap]
最新推荐文章于 2021-08-22 16:48:01 发布