(NC213758种树)牛客小白月赛29D种树

思路

直接猜测深度大于m的用小剪刀，小于等于m的用大剪刀(在根的深度为1的情况下)

#include<bits/stdc++.h>

using namespace std;

//#define int long long
const int maxn = 5e5 + 10;
int lson[maxn], rson[maxn], val[maxn],  dep[maxn];
int m  = 0;

void dfs(int u) {
    if (!lson[u]) return;
    dep[lson[u]] = dep[u] + 1, dep[rson[u]] = dep[u] + 1;
    dfs(lson[u]);
    dfs(rson[u]);
    if (dep[u] >= m)
        val[u] = min(val[lson[u]], val[rson[u]]);
    else
        val[u] = max(val[lson[u]], val[rson[u]]);
}

signed main() {
    int n; cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> lson[i] >> rson[i];
        if (lson[i]) ++m;
    }
    for (int i = 1; i <= n; ++i) cin >> val[i];
    m = (m + 1) / 2;
    dfs(1);
    cout << val[1] << endl;

}