7-3 笛卡尔树 (25 分)

  笛卡尔树是一种特殊的二叉树，其结点包含两个关键字K1和K2。首先笛卡尔树是关于K1的二叉搜索树，即结点左子树的所有K1值都比该结点的K1值小，右子树则大。其次所有结点的K2关键字满足优先队列（不妨设为最小堆）的顺序要求，即该结点的K2值比其子树中所有结点的K2值小。给定一棵二叉树，请判断该树是否笛卡尔树。

输入格式:

  输入首先给出正整数N（≤1000），为树中结点的个数。随后N行，每行给出一个结点的信息，包括：结点的K1值、K2值、左孩子结点编号、右孩子结点编号。设结点从0~(N-1)顺序编号。若某结点不存在孩子结点，则该位置给出−1。

输出格式:

  输出YES如果该树是一棵笛卡尔树；否则输出NO。

输入样例1:

6
8 27 5 1
9 40 -1 -1
10 20 0 3
12 21 -1 4
15 22 -1 -1
5 35 -1 -1

输出样例1:

YES

输入样例2:

6
8 27 5 1
9 40 -1 -1
10 20 0 3
12 11 -1 4
15 22 -1 -1
50 35 -1 -1

输出样例2:

NO

Code

#include<bits/stdc++.h>
#define ll long long
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
const ll MAXN = 1e12 + 10;
ll n, m, i, j, k, t, w, x, y, z, in, flag, cou, sum, maxn, minn;
string s, s1, s2;
const ll INF = 1e9 + 7;
struct Storage
{
    ll k1, k2, left, right;
};
map<ll, Storage>a;
map<ll, ll>mm;
pair<ll, ll> maxnbuildtree ( ll f )
{
    ll maxn1 = a[f].k1, maxn2 = a[f].k2;

    if ( a[f].left != -1 )
    {
        pair<ll, ll>p = maxnbuildtree ( a[f].left );
        maxn1 = max ( maxn1, p.first );
        maxn2 = max ( maxn2, p.second );
    }

    if ( a[f].right != -1 )
    {
        pair<ll, ll>p = maxnbuildtree ( a[f].right );
        maxn1 = max ( maxn1, p.first );
        maxn2 = max ( maxn2, p.second );
    }

    return {maxn1, maxn2};
}
pair<ll, ll> minnbuildtree ( ll f )
{
    ll minn1 = a[f].k1, minn2 = a[f].k2;

    if ( a[f].left != -1 )
    {
        pair<ll, ll>p = minnbuildtree ( a[f].left );
        minn1 = min ( minn1, p.first );
        minn2 = min ( minn2, p.second );
    }

    if ( a[f].right != -1 )
    {
        pair<ll, ll>p = minnbuildtree ( a[f].right );
        minn1 = min ( minn1, p.first );
        minn2 = min ( minn2, p.second );
    }

    return {minn1, minn2};
}
int main()
{
    for ( cin >> n, i = m = 0, j = 1; i < n; i++ )
        cin >> a[i].k1 >> a[i].k2 >> a[i].left >> a[i].right, mm[a[i].left] = mm[a[i].right] = 1;

    for ( m = 0; m < n; m++ )
    {
        if ( a[m].left != -1 )
        {
            pair<ll, ll>p1 = maxnbuildtree ( a[m].left );

            pair<ll, ll>p2 = minnbuildtree ( a[m].left );

            if ( a[m].k1 < p1.first ) j = 0;

            if ( a[m].k2 > p2.second ) j = 0;
        }

        if ( a[m].right != -1 )
        {

            pair<ll, ll>p1 = minnbuildtree ( a[m].right );

            if ( a[m].k1 > p1.first ) j = 0;

            if ( a[m].k2 > p1.second ) j = 0;
        }
    }
    cout << ( j ? "YES" : "NO" ) << endl;
    return 0;
}