1147 Heaps

                                     1147 Heaps (30 分)

In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: if P is a parent node of C, then the key (the value) of P is either greater than or equal to (in a max heap) or less than or equal to (in a min heap) the key of C. A common implementation of a heap is the binary heap, in which the tree is a complete binary tree. (Quoted from Wikipedia at https://en.wikipedia.org/wiki/Heap_(data_structure))

Your job is to tell if a given complete binary tree is a heap.

Input Specification:

Each input file contains one test case. For each case, the first line gives two positive integers: M (≤ 100), the number of trees to be tested; and N (1 < N ≤ 1,000), the number of keys in each tree, respectively. Then M lines follow, each contains N distinct integer keys (all in the range of int), which gives the level order traversal sequence of a complete binary tree.

Output Specification:

For each given tree, print in a line Max Heap if it is a max heap, or Min Heap for a min heap, or Not Heap if it is not a heap at all. Then in the next line print the tree's postorder traversal sequence. All the numbers are separated by a space, and there must no extra space at the beginning or the end of the line.

Sample Input:

3 8
98 72 86 60 65 12 23 50
8 38 25 58 52 82 70 60
10 28 15 12 34 9 8 56

Sample Output:

Max Heap
50 60 65 72 12 23 86 98
Min Heap
60 58 52 38 82 70 25 8
Not Heap
56 12 34 28 9 8 15 10

 

#include <iostream>
#include<bits/stdc++.h>
using namespace std;
int m,n,heap[1001];
vector< vector<int> > ans;
vector<int> p;
void post(int index)
{
    if(index>n)
        return ;
    post(2*index);
    post(2*index+1);
    p.push_back(heap[index]);
}
void judge(int index,vector<int> v)
{
    if(index>n)
        return;
    v.push_back(heap[index]);
    if(2*index>n)
        ans.push_back(v);
    judge(2*index,v);
    judge(2*index+1,v);
    v.pop_back();
}
int juvec(vector<int> v)
{
    int cnt1=0,cnt2=0;
    for(int i=1;i<v.size();i++)
        if(v[i]> v[i-1])
            cnt1++;
    if(cnt1==v.size()-1)
        return 1;
    for(int i=1;i<v.size();i++)
        if(v[i]< v[i-1])
            cnt2++;
    if(cnt2==v.size()-1)
        return -1;
    return 0;
}
int main()
{
    cin>>m>>n;
    for(int i=0;i<m;i++)
    {
        ans.clear();
        for(int j=1;j<=n;j++)
        {
            cin>>heap[j];
        }
        vector<int> v;
        judge(1,v);
        int cnt1=0,cnt2=0;
        for(int j=0;j<ans.size();j++)
        {
            if(juvec(ans[j])==1)
                cnt1++;
            if(juvec(ans[j])==-1)
                cnt2++;
        }
        if(cnt1==ans.size())
            cout<<"Min Heap"<<endl;
         else if(cnt2==ans.size())
            cout<<"Max Heap"<<endl;
        else
            cout<<"Not Heap"<<endl;
        p.clear();
        post(1);
        cout<<p[0];
        for(int j=1;j<p.size();j++)
            cout<<" "<<p[j];
        cout<<endl;
    }
    return 0;
}