1155 Heap Paths

题干前半略。

Sample Input 1:

8
98 72 86 60 65 12 23 50

 

Sample Output 1:

98 86 23
98 86 12
98 72 65
98 72 60 50
Max Heap

 

Sample Input 2:

8
8 38 25 58 52 82 70 60

 

Sample Output 2:

8 25 70
8 25 82
8 38 52
8 38 58 60
Min Heap

 

Sample Input 3:

8
10 28 15 12 34 9 8 56

 

Sample Output 3:

10 15 8
10 15 9
10 28 34
10 28 12 56
Not Heap

#include<stdio.h>
#include<algorithm>
#include<vector>

using namespace std;

int seq[1005];
vector<int> result[1005];
vector<int> temp;
int num;
int c;
void dfs(int root)
{
    if(root*2+1>num) 
    {
        temp.push_back(seq[root]);
        result[c]=temp;
        c++;
        temp.pop_back();
        return ;
    }
    temp.push_back(seq[root]);
    if(root*2+2<num) dfs(root*2+2);
    if(root*2+1<num) dfs(root*2+1);
    temp.pop_back();
    return ;
}
int mark;
bool flag;
int main()
{
    
    scanf("%d",&num);
    for(int i=0;i<num;i++)
    {
        scanf("%d",&seq[i]);
    }
    dfs(0);
    if(seq[0]<seq[1]) mark=-1;  //minheap
    else mark=1; //maxheap
    for(int i=0;i<c;i++)
    {
        for(int t=0;t<result[i].size();t++)
        {
            if(t!=0)
            {
                if(mark==1)
                {
                    if(result[i][t]>result[i][t-1]) flag=true;
                }
                else if(mark==-1)
                {
                    if(result[i][t]<result[i][t-1]) flag=true;
                }
            }
            printf("%d",result[i][t]);
            if(t!=result[i].size()-1) printf(" ");
        }
        printf("\n"); 
    }
    if(flag==true)
    {
        printf("Not Heap");
    }
    else
    {
        if(mark==1) printf("Max Heap");
        else printf("Min Heap");
    }
    
}