L2-012 关于堆的判断 (25 分)

原题链接

#include<bits/stdc++.h>
using namespace std;
int a[111111],cnt;
int inf=999999999;
map<int,int>p;
void creat(int x)
{
    a[++cnt]=x;
    int t=cnt;
    while (t>1&&(a[t/2]>a[t]))
    {
        a[t]=a[t/2];
        a[t/2]=x;
        t/=2;
    }
    a[t]=x;
}
int main()
{
    int n,m,x,y;
    string s;
    cin>>n>>m;
    cnt=0;
    for(int i=1;i<=n;i++)
    {
        cin>>x;
        creat(x);
    }
    for(int i=1;i<=n;i++)
    {
        p[a[i]]=i;
    }
    for(int i=0;i<m;i++)
    {
        cin>>x;
        cin>>s;
        if(s[0]=='a')
        {
         cin>>y;
         getline(cin,s);
          if(p[x]/2==p[y]/2)
          {
              cout<<"T"<<endl;
          }
          else
          {
              cout<<"F"<<endl;
          }
        }
        else
        {
            cin>>s;
            cin>>s;
            if(s[0]=='r')
            {
                if(p[x]==1)
                cout<<"T"<<endl;
                else
                cout<<"F"<<endl;  
            }
           else if(s[0]=='p')
            {
                cin>>s;
                cin>>y;
                if(p[x]==p[y]/2)
                cout<<"T"<<endl;
                else
                cout<<"F"<<endl;  
            }
            else
            {
                cin>>s;
                cin>>y;
                 if(p[x]/2==p[y])
                cout<<"T"<<endl;
                else
                cout<<"F"<<endl; 
            }
            
        }
        
    }
}