1155 Heap Paths （30 分）

这道题不知道哪出了错误有一个测试点过不了

#include<iostream>
#include<vector>
using namespace std;
int a[1100];
int n;
vector<vector<int>> sp;
void dfs(int index, vector<int> p)
{

    if (2 * index + 2 <n)
    {
        p.push_back(a[2 * index + 2]);
        dfs(2 * index + 2, p);
        p.pop_back();
    }
    if (2 * index + 1 < n)
    {
        p.push_back(a[2 * index + 1]);
        dfs(2 * index + 1, p);
        p.pop_back();
    }
    if (2 * index + 1 >= n && 2 * index + 2 >= n){
        //cout << a[index]<<endl;
        sp.push_back(p);
        return;
    }
}
int main()
{

    cin >> n;
    for (int i = 0; i < n; i++)
    {
        int x = 0;
        cin >> x; a[i] = x;
    }
    vector<int> p; p.push_back(a[0]);
    dfs(0, p);
    bool is = true; bool may = true;
    for (int i = 0; i < sp.size(); i++)
    {
        int temp = sp[i][0]; int size = 0;int equal=0;
        for (int j = 0; j < sp[i].size(); j++)
        {
           if(j>0 && temp==sp[i][j]){equal++;temp=sp[i][j];}
            if (j>0 && temp > sp[i][j]){ size++; temp = sp[i][j];may = false; }
            if (j>0 && temp <sp[i][j]){ size--; temp = sp[i][j]; }
            printf("%d", sp[i][j]);
            if (j != sp[i].size() - 1)printf(" ");
        }
        if (abs(size)+equal != sp[i].size() - 1){ is = false; }
        printf("
");
    }
    if (is){
        if (!may)printf("Max Heap");
        else printf("Min Heap");
    }
    else printf("Not Heap");
    return 0;
}