PTA关于堆的判断

一、题目描述

　　

 

 二、解题思路

　　每次插入一个元素我就进行一次堆的调整，不要存着最后再进行堆调整。用一个map记录每个元素在队中的位置，剩下的就是读入的问题了。

三、代码实现

#include "bits/stdc++.h"
using namespace std;
const int inf = -1e9 + 10;
int heap[1010];
map <int,int> mp;
void heapify(int idx)
{
    if(idx == 1)
        return;
    while(idx > 1){
        if(heap[idx] < heap[idx / 2])
            swap(heap[idx],heap[idx / 2]);
        else
            break;
        idx /= 2;
    }
}
int main()
{
    int n,m;
    cin >> n >> m;
    for(int i = 1;i <= n;i++){
        cin >> heap[i];
        heapify(i);
    }
    for(int i = 1;i <= n;i++)
        mp[heap[i]] = i;
    while(m--){
        int val1;
        int val2;
        string s;
        cin >> val1;
        cin >> s;
        if(s == "and"){
            cin >> val2;
            getline(cin,s);
            int i;
            if(mp[val1] / 2 == mp[val2] / 2)
                cout << "T" << endl;
            else
                cout << "F" << endl;
        }
        else{
            cin >> s;
            if(s == "the"){
                cin >> s;
                if(s == "root"){
                    if(mp[val1] == 1)
                        cout << "T" << endl;
                    else
                        cout << "F" << endl;
                }
                else if(s == "parent"){
                    cin >> s;
                    cin >> val2;
                    int i;
                    if(mp[val2] / 2 == mp[val1])
                        cout << "T" << endl;
                    else
                        cout << "F" << endl;
                }
            }
            else if(s == "a"){
                cin >> s;
                cin >> s;
                cin >> val2;
                if(mp[val1] / 2 == mp[val2])
                    cout << "T" << endl;
                else
                    cout << "F" << endl;
            }
        }
    }
    return 0;
}